Fast Erasure and Error decoding of Algebraic Geometry Codes up to the Feng-Rao Bound

DEFF Research Database (Denmark)

Jensen, Helge Elbrønd; Sakata, S.; Leonard, D.

1996-01-01

This paper gives an errata(that is erasure-and error-) decoding algorithm of one-point algebraic geometry codes up to the Feng-Rao designed minimum distance using Sakata's multidimensional generalization of the Berlekamp-massey algorithm and the votin procedure of Feng and Rao.......This paper gives an errata(that is erasure-and error-) decoding algorithm of one-point algebraic geometry codes up to the Feng-Rao designed minimum distance using Sakata's multidimensional generalization of the Berlekamp-massey algorithm and the votin procedure of Feng and Rao....

Analysis of error floor of LDPC codes under LP decoding over the BSC

Energy Technology Data Exchange (ETDEWEB)

Chertkov, Michael [Los Alamos National Laboratory; Chilappagari, Shashi [UNIV OF AZ; Vasic, Bane [UNIV OF AZ; Stepanov, Mikhail [UNIV OF AZ

2009-01-01

We consider linear programming (LP) decoding of a fixed low-density parity-check (LDPC) code over the binary symmetric channel (BSC). The LP decoder fails when it outputs a pseudo-codeword which is not a codeword. We propose an efficient algorithm termed the instanton search algorithm (ISA) which, given a random input, generates a set of flips called the BSC-instanton and prove that: (a) the LP decoder fails for any set of flips with support vector including an instanton; (b) for any input, the algorithm outputs an instanton in the number of steps upper-bounded by twice the number of flips in the input. We obtain the number of unique instantons of different sizes by running the ISA sufficient number of times. We then use the instanton statistics to predict the performance of the LP decoding over the BSC in the error floor region. We also propose an efficient semi-analytical method to predict the performance of LP decoding over a large range of transition probabilities of the BSC.

Adaptive decoding of convolutional codes

Science.gov (United States)

Hueske, K.; Geldmacher, J.; Götze, J.

2007-06-01

Convolutional codes, which are frequently used as error correction codes in digital transmission systems, are generally decoded using the Viterbi Decoder. On the one hand the Viterbi Decoder is an optimum maximum likelihood decoder, i.e. the most probable transmitted code sequence is obtained. On the other hand the mathematical complexity of the algorithm only depends on the used code, not on the number of transmission errors. To reduce the complexity of the decoding process for good transmission conditions, an alternative syndrome based decoder is presented. The reduction of complexity is realized by two different approaches, the syndrome zero sequence deactivation and the path metric equalization. The two approaches enable an easy adaptation of the decoding complexity for different transmission conditions, which results in a trade-off between decoding complexity and error correction performance.

Adaptive decoding of convolutional codes

Directory of Open Access Journals (Sweden)

K. Hueske

2007-06-01

Full Text Available Convolutional codes, which are frequently used as error correction codes in digital transmission systems, are generally decoded using the Viterbi Decoder. On the one hand the Viterbi Decoder is an optimum maximum likelihood decoder, i.e. the most probable transmitted code sequence is obtained. On the other hand the mathematical complexity of the algorithm only depends on the used code, not on the number of transmission errors. To reduce the complexity of the decoding process for good transmission conditions, an alternative syndrome based decoder is presented. The reduction of complexity is realized by two different approaches, the syndrome zero sequence deactivation and the path metric equalization. The two approaches enable an easy adaptation of the decoding complexity for different transmission conditions, which results in a trade-off between decoding complexity and error correction performance.

Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes. Part 3; The Map and Related Decoding Algirithms

Science.gov (United States)

Lin, Shu; Fossorier, Marc

1998-01-01

In a coded communication system with equiprobable signaling, MLD minimizes the word error probability and delivers the most likely codeword associated with the corresponding received sequence. This decoding has two drawbacks. First, minimization of the word error probability is not equivalent to minimization of the bit error probability. Therefore, MLD becomes suboptimum with respect to the bit error probability. Second, MLD delivers a hard-decision estimate of the received sequence, so that information is lost between the input and output of the ML decoder. This information is important in coded schemes where the decoded sequence is further processed, such as concatenated coding schemes, multi-stage and iterative decoding schemes. In this chapter, we first present a decoding algorithm which both minimizes bit error probability, and provides the corresponding soft information at the output of the decoder. This algorithm is referred to as the MAP (maximum aposteriori probability) decoding algorithm.

Mean of the typical decoding rates: a new translation efficiency index based on the analysis of ribosome profiling data.

Science.gov (United States)

Dana, Alexandra; Tuller, Tamir

2014-12-01

Gene translation modeling and prediction is a fundamental problem that has numerous biomedical implementations. In this work we present a novel, user-friendly tool/index for calculating the mean of the typical decoding rates that enables predicting translation elongation efficiency of protein coding genes for different tissue types, developmental stages, and experimental conditions. The suggested translation efficiency index is based on the analysis of the organism's ribosome profiling data. This index could be used for example to predict changes in translation elongation efficiency of lowly expressed genes that usually have relatively low and/or biased ribosomal densities and protein levels measurements, or can be used for example for predicting translation efficiency of new genetically engineered genes. We demonstrate the usability of this index via the analysis of six organisms in different tissues and developmental stages. Distributable cross platform application and guideline are available for download at: http://www.cs.tau.ac.il/~tamirtul/MTDR/MTDR_Install.html. Copyright © 2015 Dana and Tuller.

Miscoding-induced stalling of substrate translocation on the bacterial ribosome.

Science.gov (United States)

Alejo, Jose L; Blanchard, Scott C

2017-10-10

Directional transit of the ribosome along the messenger RNA (mRNA) template is a key determinant of the rate and processivity of protein synthesis. Imaging of the multistep translocation mechanism using single-molecule FRET has led to the hypothesis that substrate movements relative to the ribosome resolve through relatively long-lived late intermediates wherein peptidyl-tRNA enters the P site of the small ribosomal subunit via reversible, swivel-like motions of the small subunit head domain within the elongation factor G (GDP)-bound ribosome complex. Consistent with translocation being rate-limited by recognition and productive engagement of peptidyl-tRNA within the P site, we now show that base-pairing mismatches between the peptidyl-tRNA anticodon and the mRNA codon dramatically delay this rate-limiting, intramolecular process. This unexpected relationship between aminoacyl-tRNA decoding and translocation suggests that miscoding antibiotics may impact protein synthesis by impairing the recognition of peptidyl-tRNA in the small subunit P site during EF-G-catalyzed translocation. Strikingly, we show that elongation factor P (EF-P), traditionally known to alleviate ribosome stalling at polyproline motifs, can efficiently rescue translocation defects arising from miscoding. These findings help reveal the nature and origin of the rate-limiting steps in substrate translocation on the bacterial ribosome and indicate that EF-P can aid in resuming translation elongation stalled by miscoding errors.

Fast decoders for qudit topological codes

International Nuclear Information System (INIS)

Anwar, Hussain; Brown, Benjamin J; Campbell, Earl T; Browne, Dan E

2014-01-01

Qudit toric codes are a natural higher-dimensional generalization of the well-studied qubit toric code. However, standard methods for error correction of the qubit toric code are not applicable to them. Novel decoders are needed. In this paper we introduce two renormalization group decoders for qudit codes and analyse their error correction thresholds and efficiency. The first decoder is a generalization of a ‘hard-decisions’ decoder due to Bravyi and Haah (arXiv:1112.3252). We modify this decoder to overcome a percolation effect which limits its threshold performance for many-level quantum systems. The second decoder is a generalization of a ‘soft-decisions’ decoder due to Poulin and Duclos-Cianci (2010 Phys. Rev. Lett. 104 050504), with a small cell size to optimize the efficiency of implementation in the high dimensional case. In each case, we estimate thresholds for the uncorrelated bit-flip error model and provide a comparative analysis of the performance of both these approaches to error correction of qudit toric codes. (paper)

On Decoding Interleaved Chinese Remainder Codes

DEFF Research Database (Denmark)

Li, Wenhui; Sidorenko, Vladimir; Nielsen, Johan Sebastian Rosenkilde

2013-01-01

We model the decoding of Interleaved Chinese Remainder codes as that of finding a short vector in a Z-lattice. Using the LLL algorithm, we obtain an efficient decoding algorithm, correcting errors beyond the unique decoding bound and having nearly linear complexity. The algorithm can fail...... with a probability dependent on the number of errors, and we give an upper bound for this. Simulation results indicate that the bound is close to the truth. We apply the proposed decoding algorithm for decoding a single CR code using the idea of “Power” decoding, suggested for Reed-Solomon codes. A combination...... of these two methods can be used to decode low-rate Interleaved Chinese Remainder codes....

Iterative List Decoding

DEFF Research Database (Denmark)

Justesen, Jørn; Høholdt, Tom; Hjaltason, Johan

2005-01-01

We analyze the relation between iterative decoding and the extended parity check matrix. By considering a modified version of bit flipping, which produces a list of decoded words, we derive several relations between decodable error patterns and the parameters of the code. By developing a tree...... of codewords at minimal distance from the received vector, we also obtain new information about the code....

Real-time minimal-bit-error probability decoding of convolutional codes

Science.gov (United States)

Lee, L.-N.

1974-01-01

A recursive procedure is derived for decoding of rate R = 1/n binary convolutional codes which minimizes the probability of the individual decoding decisions for each information bit, subject to the constraint that the decoding delay be limited to Delta branches. This new decoding algorithm is similar to, but somewhat more complex than, the Viterbi decoding algorithm. A real-time, i.e., fixed decoding delay, version of the Viterbi algorithm is also developed and used for comparison to the new algorithm on simulated channels. It is shown that the new algorithm offers advantages over Viterbi decoding in soft-decision applications, such as in the inner coding system for concatenated coding.

Real-time minimal bit error probability decoding of convolutional codes

Science.gov (United States)

Lee, L. N.

1973-01-01

A recursive procedure is derived for decoding of rate R=1/n binary convolutional codes which minimizes the probability of the individual decoding decisions for each information bit subject to the constraint that the decoding delay be limited to Delta branches. This new decoding algorithm is similar to, but somewhat more complex than, the Viterbi decoding algorithm. A real-time, i.e. fixed decoding delay, version of the Viterbi algorithm is also developed and used for comparison to the new algorithm on simulated channels. It is shown that the new algorithm offers advantages over Viterbi decoding in soft-decision applications such as in the inner coding system for concatenated coding.

Decoding of interleaved Reed-Solomon codes using improved power decoding

DEFF Research Database (Denmark)

Puchinger, Sven; Rosenkilde ne Nielsen, Johan

2017-01-01

We propose a new partial decoding algorithm for m-interleaved Reed-Solomon (IRS) codes that can decode, with high probability, a random error of relative weight 1 − Rm/m+1 at all code rates R, in time polynomial in the code length n. For m > 2, this is an asymptotic improvement over the previous...... state-of-the-art for all rates, and the first improvement for R > 1/3 in the last 20 years. The method combines collaborative decoding of IRS codes with power decoding up to the Johnson radius....

Fast Erasure-and error decoding of algebraic geometry codes up to the Feng-Rao bound

DEFF Research Database (Denmark)

Høholdt, Tom; Jensen, Helge Elbrønd; Sakata, Shojiro

1998-01-01

This correspondence gives an errata (that is erasure-and error-) decoding algorithm of one-point algebraic-geometry codes up to the Feng-Rao designed minimum distance using Sakata's multidimensional generalization of the Berlekamp-Massey algorithm and the voting procedure of Feng and Rao....

EEG-based decoding of error-related brain activity in a real-world driving task

Science.gov (United States)

Zhang, H.; Chavarriaga, R.; Khaliliardali, Z.; Gheorghe, L.; Iturrate, I.; Millán, J. d. R.

2015-12-01

Objectives. Recent studies have started to explore the implementation of brain-computer interfaces (BCI) as part of driving assistant systems. The current study presents an EEG-based BCI that decodes error-related brain activity. Such information can be used, e.g., to predict driver’s intended turning direction before reaching road intersections. Approach. We executed experiments in a car simulator (N = 22) and a real car (N = 8). While subject was driving, a directional cue was shown before reaching an intersection, and we classified the presence or not of an error-related potentials from EEG to infer whether the cued direction coincided with the subject’s intention. In this protocol, the directional cue can correspond to an estimation of the driving direction provided by a driving assistance system. We analyzed ERPs elicited during normal driving and evaluated the classification performance in both offline and online tests. Results. An average classification accuracy of 0.698 ± 0.065 was obtained in offline experiments in the car simulator, while tests in the real car yielded a performance of 0.682 ± 0.059. The results were significantly higher than chance level for all cases. Online experiments led to equivalent performances in both simulated and real car driving experiments. These results support the feasibility of decoding these signals to help estimating whether the driver’s intention coincides with the advice provided by the driving assistant in a real car. Significance. The study demonstrates a BCI system in real-world driving, extending the work from previous simulated studies. As far as we know, this is the first online study in real car decoding driver’s error-related brain activity. Given the encouraging results, the paradigm could be further improved by using more sophisticated machine learning approaches and possibly be combined with applications in intelligent vehicles.

Neural Decoder for Topological Codes

Science.gov (United States)

Torlai, Giacomo; Melko, Roger G.

2017-07-01

We present an algorithm for error correction in topological codes that exploits modern machine learning techniques. Our decoder is constructed from a stochastic neural network called a Boltzmann machine, of the type extensively used in deep learning. We provide a general prescription for the training of the network and a decoding strategy that is applicable to a wide variety of stabilizer codes with very little specialization. We demonstrate the neural decoder numerically on the well-known two-dimensional toric code with phase-flip errors.

Decoding small surface codes with feedforward neural networks

Science.gov (United States)

Varsamopoulos, Savvas; Criger, Ben; Bertels, Koen

2018-01-01

Surface codes reach high error thresholds when decoded with known algorithms, but the decoding time will likely exceed the available time budget, especially for near-term implementations. To decrease the decoding time, we reduce the decoding problem to a classification problem that a feedforward neural network can solve. We investigate quantum error correction and fault tolerance at small code distances using neural network-based decoders, demonstrating that the neural network can generalize to inputs that were not provided during training and that they can reach similar or better decoding performance compared to previous algorithms. We conclude by discussing the time required by a feedforward neural network decoder in hardware.

The effect of tRNA levels on decoding times of mRNA codons.

Science.gov (United States)

Dana, Alexandra; Tuller, Tamir

2014-08-01

The possible effect of transfer ribonucleic acid (tRNA) concentrations on codons decoding time is a fundamental biomedical research question; however, due to a large number of variables affecting this process and the non-direct relation between them, a conclusive answer to this question has eluded so far researchers in the field. In this study, we perform a novel analysis of the ribosome profiling data of four organisms which enables ranking the decoding times of different codons while filtering translational phenomena such as experimental biases, extreme ribosomal pauses and ribosome traffic jams. Based on this filtering, we show for the first time that there is a significant correlation between tRNA concentrations and the codons estimated decoding time both in prokaryotes and in eukaryotes in natural conditions (-0.38 to -0.66, all P values decoding times are not correlated with aminoacyl-tRNA levels. The reported results support the conjecture that translation efficiency is directly influenced by the tRNA levels in the cell. Thus, they should help to understand the evolution of synonymous aspects of coding sequences via the adaptation of their codons to the tRNA pool. © The Author(s) 2014. Published by Oxford University Press on behalf of Nucleic Acids Research.

Decoding linear error-correcting codes up to half the minimum distance with Gröbner bases

NARCIS (Netherlands)

Bulygin, S.; Pellikaan, G.R.; Sala, M.; Mora, T.; Perret, L.; Sakata, S.; Traverso, C.

2009-01-01

In this short note we show how one can decode linear error-correcting codes up to half the minimum distance via solving a system of polynomial equations over a finite field. We also explicitly present the reduced Gröbner basis for the system considered.

Decoding of concatenated codes with interleaved outer codes

DEFF Research Database (Denmark)

Justesen, Jørn; Høholdt, Tom; Thommesen, Christian

2004-01-01

Recently Bleichenbacher et al. proposed a decoding algorithm for interleaved (N, K) Reed-Solomon codes, which allows close to N-K errors to be corrected in many cases. We discuss the application of this decoding algorithm to concatenated codes.......Recently Bleichenbacher et al. proposed a decoding algorithm for interleaved (N, K) Reed-Solomon codes, which allows close to N-K errors to be corrected in many cases. We discuss the application of this decoding algorithm to concatenated codes....

Optimal and efficient decoding of concatenated quantum block codes

International Nuclear Information System (INIS)

Poulin, David

2006-01-01

We consider the problem of optimally decoding a quantum error correction code--that is, to find the optimal recovery procedure given the outcomes of partial ''check'' measurements on the system. In general, this problem is NP hard. However, we demonstrate that for concatenated block codes, the optimal decoding can be efficiently computed using a message-passing algorithm. We compare the performance of the message-passing algorithm to that of the widespread blockwise hard decoding technique. Our Monte Carlo results using the five-qubit and Steane's code on a depolarizing channel demonstrate significant advantages of the message-passing algorithms in two respects: (i) Optimal decoding increases by as much as 94% the error threshold below which the error correction procedure can be used to reliably send information over a noisy channel; and (ii) for noise levels below these thresholds, the probability of error after optimal decoding is suppressed at a significantly higher rate, leading to a substantial reduction of the error correction overhead

On Lattice Sequential Decoding for Large MIMO Systems

KAUST Repository

Ali, Konpal S.

2014-04-01

Due to their ability to provide high data rates, Multiple-Input Multiple-Output (MIMO) wireless communication systems have become increasingly popular. Decoding of these systems with acceptable error performance is computationally very demanding. In the case of large overdetermined MIMO systems, we employ the Sequential Decoder using the Fano Algorithm. A parameter called the bias is varied to attain different performance-complexity trade-offs. Low values of the bias result in excellent performance but at the expense of high complexity and vice versa for higher bias values. We attempt to bound the error by bounding the bias, using the minimum distance of a lattice. Also, a particular trend is observed with increasing SNR: a region of low complexity and high error, followed by a region of high complexity and error falling, and finally a region of low complexity and low error. For lower bias values, the stages of the trend are incurred at lower SNR than for higher bias values. This has the important implication that a low enough bias value, at low to moderate SNR, can result in low error and low complexity even for large MIMO systems. Our work is compared against Lattice Reduction (LR) aided Linear Decoders (LDs). Another impressive observation for low bias values that satisfy the error bound is that the Sequential Decoder\\'s error is seen to fall with increasing system size, while it grows for the LR-aided LDs. For the case of large underdetermined MIMO systems, Sequential Decoding with two preprocessing schemes is proposed – 1) Minimum Mean Square Error Generalized Decision Feedback Equalization (MMSE-GDFE) preprocessing 2) MMSE-GDFE preprocessing, followed by Lattice Reduction and Greedy Ordering. Our work is compared against previous work which employs Sphere Decoding preprocessed using MMSE-GDFE, Lattice Reduction and Greedy Ordering. For the case of large systems, this results in high complexity and difficulty in choosing the sphere radius. Our schemes

Iterative channel decoding of FEC-based multiple-description codes.

Science.gov (United States)

Chang, Seok-Ho; Cosman, Pamela C; Milstein, Laurence B

2012-03-01

Multiple description coding has been receiving attention as a robust transmission framework for multimedia services. This paper studies the iterative decoding of FEC-based multiple description codes. The proposed decoding algorithms take advantage of the error detection capability of Reed-Solomon (RS) erasure codes. The information of correctly decoded RS codewords is exploited to enhance the error correction capability of the Viterbi algorithm at the next iteration of decoding. In the proposed algorithm, an intradescription interleaver is synergistically combined with the iterative decoder. The interleaver does not affect the performance of noniterative decoding but greatly enhances the performance when the system is iteratively decoded. We also address the optimal allocation of RS parity symbols for unequal error protection. For the optimal allocation in iterative decoding, we derive mathematical equations from which the probability distributions of description erasures can be generated in a simple way. The performance of the algorithm is evaluated over an orthogonal frequency-division multiplexing system. The results show that the performance of the multiple description codes is significantly enhanced.

Iterative List Decoding of Concatenated Source-Channel Codes

Directory of Open Access Journals (Sweden)

Hedayat Ahmadreza

2005-01-01

Full Text Available Whenever variable-length entropy codes are used in the presence of a noisy channel, any channel errors will propagate and cause significant harm. Despite using channel codes, some residual errors always remain, whose effect will get magnified by error propagation. Mitigating this undesirable effect is of great practical interest. One approach is to use the residual redundancy of variable length codes for joint source-channel decoding. In this paper, we improve the performance of residual redundancy source-channel decoding via an iterative list decoder made possible by a nonbinary outer CRC code. We show that the list decoding of VLC's is beneficial for entropy codes that contain redundancy. Such codes are used in state-of-the-art video coders, for example. The proposed list decoder improves the overall performance significantly in AWGN and fully interleaved Rayleigh fading channels.

Decoding error-correcting codes with Gröbner bases

NARCIS (Netherlands)

Bulygin, S.; Pellikaan, G.R.; Veldhuis, R.; Cronie, H.; Hoeksema, H.

2007-01-01

The decoding of arbitrary linear block codes is accomplished by solving a system of quadratic equations by means of Buchberger’s algorithm for finding a Gröbner basis. This generalizes the algorithm of Berlekamp-Massey for decoding Reed Solomon, Goppa and cyclic codes up to half the true minimum

Symbol synchronization for the TDRSS decoder

Science.gov (United States)

Costello, D. J., Jr.

1983-01-01

Each 8 bits out of the Viterbi decoder correspond to one symbol of the R/S code. Synchronization must be maintained here so that each 8-bit symbol delivered to the R/S decoder corresponds to an 8-bit symbol from the R/S encoder. Lack of synchronization, would cause an error in almost every R/S symbol since even a - 1-bit sync slip shifts every bit in each 8-bit symbol by one position, therby confusing the mapping betweeen 8-bit sequences and symbols. The error correcting capability of the R/S code would be exceeded. Possible ways to correcting this condition include: (1) designing the R/S decoder to recognize the overload and shifting the output sequence of the inner decoder to establish a different sync state; (2) using the characteristics of the inner decoder to establish symbol synchronization for the outer code, with or without a deinterleaver and an interleaver; and (3) modifying the encoder to alternate periodically between two sets of generators.

Image transmission system using adaptive joint source and channel decoding

Science.gov (United States)

Liu, Weiliang; Daut, David G.

2005-03-01

In this paper, an adaptive joint source and channel decoding method is designed to accelerate the convergence of the iterative log-dimain sum-product decoding procedure of LDPC codes as well as to improve the reconstructed image quality. Error resilience modes are used in the JPEG2000 source codec, which makes it possible to provide useful source decoded information to the channel decoder. After each iteration, a tentative decoding is made and the channel decoded bits are then sent to the JPEG2000 decoder. Due to the error resilience modes, some bits are known to be either correct or in error. The positions of these bits are then fed back to the channel decoder. The log-likelihood ratios (LLR) of these bits are then modified by a weighting factor for the next iteration. By observing the statistics of the decoding procedure, the weighting factor is designed as a function of the channel condition. That is, for lower channel SNR, a larger factor is assigned, and vice versa. Results show that the proposed joint decoding methods can greatly reduce the number of iterations, and thereby reduce the decoding delay considerably. At the same time, this method always outperforms the non-source controlled decoding method up to 5dB in terms of PSNR for various reconstructed images.

LDPC Codes--Structural Analysis and Decoding Techniques

Science.gov (United States)

Zhang, Xiaojie

2012-01-01

Low-density parity-check (LDPC) codes have been the focus of much research over the past decade thanks to their near Shannon limit performance and to their efficient message-passing (MP) decoding algorithms. However, the error floor phenomenon observed in MP decoding, which manifests itself as an abrupt change in the slope of the error-rate curve,…

On Lattice Sequential Decoding for The Unconstrained AWGN Channel

KAUST Repository

Abediseid, Walid

2012-10-01

In this paper, the performance limits and the computational complexity of the lattice sequential decoder are analyzed for the unconstrained additive white Gaussian noise channel. The performance analysis available in the literature for such a channel has been studied only under the use of the minimum Euclidean distance decoder that is commonly referred to as the lattice decoder. Lattice decoders based on solutions to the NP-hard closest vector problem are very complex to implement, and the search for low complexity receivers for the detection of lattice codes is considered a challenging problem. However, the low computational complexity advantage that sequential decoding promises, makes it an alternative solution to the lattice decoder. In this work, we characterize the performance and complexity tradeoff via the error exponent and the decoding complexity, respectively, of such a decoder as a function of the decoding parameter --- the bias term. For the above channel, we derive the cut-off volume-to-noise ratio that is required to achieve a good error performance with low decoding complexity.

On Lattice Sequential Decoding for The Unconstrained AWGN Channel

KAUST Repository

Abediseid, Walid

2013-04-04

In this paper, the performance limits and the computational complexity of the lattice sequential decoder are analyzed for the unconstrained additive white Gaussian noise channel. The performance analysis available in the literature for such a channel has been studied only under the use of the minimum Euclidean distance decoder that is commonly referred to as the \\\\textit{lattice decoder}. Lattice decoders based on solutions to the NP-hard closest vector problem are very complex to implement, and the search for low complexity receivers for the detection of lattice codes is considered a challenging problem. However, the low computational complexity advantage that sequential decoding promises, makes it an alternative solution to the lattice decoder. In this work, we characterize the performance and complexity tradeoff via the error exponent and the decoding complexity, respectively, of such a decoder as a function of the decoding parameter --- the bias term. For the above channel, we derive the cut-off volume-to-noise ratio that is required to achieve a good error performance with low decoding complexity.

On Lattice Sequential Decoding for The Unconstrained AWGN Channel

KAUST Repository

Abediseid, Walid; Alouini, Mohamed-Slim

2012-01-01

In this paper, the performance limits and the computational complexity of the lattice sequential decoder are analyzed for the unconstrained additive white Gaussian noise channel. The performance analysis available in the literature for such a channel has been studied only under the use of the minimum Euclidean distance decoder that is commonly referred to as the lattice decoder. Lattice decoders based on solutions to the NP-hard closest vector problem are very complex to implement, and the search for low complexity receivers for the detection of lattice codes is considered a challenging problem. However, the low computational complexity advantage that sequential decoding promises, makes it an alternative solution to the lattice decoder. In this work, we characterize the performance and complexity tradeoff via the error exponent and the decoding complexity, respectively, of such a decoder as a function of the decoding parameter --- the bias term. For the above channel, we derive the cut-off volume-to-noise ratio that is required to achieve a good error performance with low decoding complexity.

Bounded-Angle Iterative Decoding of LDPC Codes

Science.gov (United States)

Dolinar, Samuel; Andrews, Kenneth; Pollara, Fabrizio; Divsalar, Dariush

2009-01-01

Bounded-angle iterative decoding is a modified version of conventional iterative decoding, conceived as a means of reducing undetected-error rates for short low-density parity-check (LDPC) codes. For a given code, bounded-angle iterative decoding can be implemented by means of a simple modification of the decoder algorithm, without redesigning the code. Bounded-angle iterative decoding is based on a representation of received words and code words as vectors in an n-dimensional Euclidean space (where n is an integer).

Hard decoding algorithm for optimizing thresholds under general Markovian noise

Science.gov (United States)

Chamberland, Christopher; Wallman, Joel; Beale, Stefanie; Laflamme, Raymond

2017-04-01

Quantum error correction is instrumental in protecting quantum systems from noise in quantum computing and communication settings. Pauli channels can be efficiently simulated and threshold values for Pauli error rates under a variety of error-correcting codes have been obtained. However, realistic quantum systems can undergo noise processes that differ significantly from Pauli noise. In this paper, we present an efficient hard decoding algorithm for optimizing thresholds and lowering failure rates of an error-correcting code under general completely positive and trace-preserving (i.e., Markovian) noise. We use our hard decoding algorithm to study the performance of several error-correcting codes under various non-Pauli noise models by computing threshold values and failure rates for these codes. We compare the performance of our hard decoding algorithm to decoders optimized for depolarizing noise and show improvements in thresholds and reductions in failure rates by several orders of magnitude. Our hard decoding algorithm can also be adapted to take advantage of a code's non-Pauli transversal gates to further suppress noise. For example, we show that using the transversal gates of the 5-qubit code allows arbitrary rotations around certain axes to be perfectly corrected. Furthermore, we show that Pauli twirling can increase or decrease the threshold depending upon the code properties. Lastly, we show that even if the physical noise model differs slightly from the hypothesized noise model used to determine an optimized decoder, failure rates can still be reduced by applying our hard decoding algorithm.

Improved Power Decoding of One-Point Hermitian Codes

DEFF Research Database (Denmark)

Puchinger, Sven; Bouw, Irene; Rosenkilde, Johan Sebastian Heesemann

2017-01-01

We propose a new partial decoding algorithm for one-point Hermitian codes that can decode up to the same number of errors as the Guruswami–Sudan decoder. Simulations suggest that it has a similar failure probability as the latter one. The algorithm is based on a recent generalization of the power...... decoding algorithm for Reed–Solomon codes and does not require an expensive root-finding step. In addition, it promises improvements for decoding interleaved Hermitian codes....

Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes

Science.gov (United States)

Lin, Shu

1998-01-01

A code trellis is a graphical representation of a code, block or convolutional, in which every path represents a codeword (or a code sequence for a convolutional code). This representation makes it possible to implement Maximum Likelihood Decoding (MLD) of a code with reduced decoding complexity. The most well known trellis-based MLD algorithm is the Viterbi algorithm. The trellis representation was first introduced and used for convolutional codes [23]. This representation, together with the Viterbi decoding algorithm, has resulted in a wide range of applications of convolutional codes for error control in digital communications over the last two decades. There are two major reasons for this inactive period of research in this area. First, most coding theorists at that time believed that block codes did not have simple trellis structure like convolutional codes and maximum likelihood decoding of linear block codes using the Viterbi algorithm was practically impossible, except for very short block codes. Second, since almost all of the linear block codes are constructed algebraically or based on finite geometries, it was the belief of many coding theorists that algebraic decoding was the only way to decode these codes. These two reasons seriously hindered the development of efficient soft-decision decoding methods for linear block codes and their applications to error control in digital communications. This led to a general belief that block codes are inferior to convolutional codes and hence, that they were not useful. Chapter 2 gives a brief review of linear block codes. The goal is to provide the essential background material for the development of trellis structure and trellis-based decoding algorithms for linear block codes in the later chapters. Chapters 3 through 6 present the fundamental concepts, finite-state machine model, state space formulation, basic structural properties, state labeling, construction procedures, complexity, minimality, and

Video Error Correction Using Steganography

Science.gov (United States)

Robie, David L.; Mersereau, Russell M.

2002-12-01

The transmission of any data is always subject to corruption due to errors, but video transmission, because of its real time nature must deal with these errors without retransmission of the corrupted data. The error can be handled using forward error correction in the encoder or error concealment techniques in the decoder. This MPEG-2 compliant codec uses data hiding to transmit error correction information and several error concealment techniques in the decoder. The decoder resynchronizes more quickly with fewer errors than traditional resynchronization techniques. It also allows for perfect recovery of differentially encoded DCT-DC components and motion vectors. This provides for a much higher quality picture in an error-prone environment while creating an almost imperceptible degradation of the picture in an error-free environment.

Cellular automaton decoders of topological quantum memories in the fault tolerant setting

International Nuclear Information System (INIS)

Herold, Michael; Eisert, Jens; Kastoryano, Michael J; Campbell, Earl T

2017-01-01

Active error decoding and correction of topological quantum codes—in particular the toric code—remains one of the most viable routes to large scale quantum information processing. In contrast, passive error correction relies on the natural physical dynamics of a system to protect encoded quantum information. However, the search is ongoing for a completely satisfactory passive scheme applicable to locally interacting two-dimensional systems. Here, we investigate dynamical decoders that provide passive error correction by embedding the decoding process into local dynamics. We propose a specific discrete time cellular-automaton decoder in the fault tolerant setting and provide numerical evidence showing that the logical qubit has a survival time extended by several orders of magnitude over that of a bare unencoded qubit. We stress that (asynchronous) dynamical decoding gives rise to a Markovian dissipative process. We hence equate cellular-automaton decoding to a fully dissipative topological quantum memory, which removes errors continuously. In this sense, uncontrolled and unwanted local noise can be corrected for by a controlled local dissipative process. We analyze the required resources, commenting on additional polylogarithmic factors beyond those incurred by an ideal constant resource dynamical decoder. (paper)

Utilizing Cross-Layer Information to Improve Performance in JPEG2000 Decoding

Directory of Open Access Journals (Sweden)

Hannes Persson

2007-01-01

Full Text Available We focus on wireless multimedia communication and investigate how cross-layer information can be used to improve performance at the application layer, using JPEG2000 as an example. The cross-layer information is in the form of soft information from the physical layer. The soft information, which is supplied by a soft decision demodulator, yields reliability measures for the received bits and is fed into two soft input iterative JPEG2000 image decoders. When errors are detected with the error detecting mechanisms in JPEG2000, the decoders utilize the soft information to point out likely transmission errors. Hence, the decoders can correct errors and increase the image quality without making time-consuming retransmissions. We believe that the proposed decoding method utilizing soft information is suitable for a general IP-based network and that it keeps the principles of a layered structure of the protocol stack intact. Further, experimental results with images transmitted over a simulated wireless channel show that a simple decoding algorithm that utilizes soft information can give high gains in image quality compared to the standard hard-decision decoding.

The SmpB C-terminal tail helps tmRNA to recognize and enter stalled ribosomes

Directory of Open Access Journals (Sweden)

Mickey R. Miller

2014-09-01

Full Text Available In bacteria, transfer-messenger RNA (tmRNA and SmpB comprise the most common and effective system for rescuing stalled ribosomes. Ribosomes stall on mRNA transcripts lacking stop codons and are rescued as the defective mRNA is swapped for the tmRNA template in a process known as trans-translation. The tmRNA–SmpB complex is recruited to the ribosome independent of a codon–anticodon interaction. Given that the ribosome uses robust discriminatory mechanisms to select against non-cognate tRNAs during canonical decoding, it has been hard to explain how this can happen. Recent structural and biochemical studies show that SmpB licenses tmRNA entry through its interactions with the decoding center and mRNA channel. In particular, the C-terminal tail of SmpB promotes both EFTu activation and accommodation of tmRNA, the former through interactions with 16S rRNA nucleotide G530 and the latter through interactions with the mRNA channel downstream of the A site. Here we present a detailed model of the earliest steps in trans-translation, and in light of these mechanistic considerations, revisit the question of how tmRNA preferentially reacts with stalled, non-translating ribosomes.

Fast and Flexible Successive-Cancellation List Decoders for Polar Codes

Science.gov (United States)

Hashemi, Seyyed Ali; Condo, Carlo; Gross, Warren J.

2017-11-01

Polar codes have gained significant amount of attention during the past few years and have been selected as a coding scheme for the next generation of mobile broadband standard. Among decoding schemes, successive-cancellation list (SCL) decoding provides a reasonable trade-off between the error-correction performance and hardware implementation complexity when used to decode polar codes, at the cost of limited throughput. The simplified SCL (SSCL) and its extension SSCL-SPC increase the speed of decoding by removing redundant calculations when encountering particular information and frozen bit patterns (rate one and single parity check codes), while keeping the error-correction performance unaltered. In this paper, we improve SSCL and SSCL-SPC by proving that the list size imposes a specific number of bit estimations required to decode rate one and single parity check codes. Thus, the number of estimations can be limited while guaranteeing exactly the same error-correction performance as if all bits of the code were estimated. We call the new decoding algorithms Fast-SSCL and Fast-SSCL-SPC. Moreover, we show that the number of bit estimations in a practical application can be tuned to achieve desirable speed, while keeping the error-correction performance almost unchanged. Hardware architectures implementing both algorithms are then described and implemented: it is shown that our design can achieve 1.86 Gb/s throughput, higher than the best state-of-the-art decoders.

Video Error Correction Using Steganography

Directory of Open Access Journals (Sweden)

Robie David L

2002-01-01

Full Text Available The transmission of any data is always subject to corruption due to errors, but video transmission, because of its real time nature must deal with these errors without retransmission of the corrupted data. The error can be handled using forward error correction in the encoder or error concealment techniques in the decoder. This MPEG-2 compliant codec uses data hiding to transmit error correction information and several error concealment techniques in the decoder. The decoder resynchronizes more quickly with fewer errors than traditional resynchronization techniques. It also allows for perfect recovery of differentially encoded DCT-DC components and motion vectors. This provides for a much higher quality picture in an error-prone environment while creating an almost imperceptible degradation of the picture in an error-free environment.

Generalized Sudan's List Decoding for Order Domain Codes

DEFF Research Database (Denmark)

Geil, Hans Olav; Matsumoto, Ryutaroh

2007-01-01

We generalize Sudan's list decoding algorithm without multiplicity to evaluation codes coming from arbitrary order domains. The number of correctable errors by the proposed method is larger than the original list decoding without multiplicity....

Performance-complexity tradeoff in sequential decoding for the unconstrained AWGN channel

KAUST Repository

Abediseid, Walid

2013-06-01

In this paper, the performance limits and the computational complexity of the lattice sequential decoder are analyzed for the unconstrained additive white Gaussian noise channel. The performance analysis available in the literature for such a channel has been studied only under the use of the minimum Euclidean distance decoder that is commonly referred to as the lattice decoder. Lattice decoders based on solutions to the NP-hard closest vector problem are very complex to implement, and the search for low complexity receivers for the detection of lattice codes is considered a challenging problem. However, the low computational complexity advantage that sequential decoding promises, makes it an alternative solution to the lattice decoder. In this work, we characterize the performance and complexity tradeoff via the error exponent and the decoding complexity, respectively, of such a decoder as a function of the decoding parameter - the bias term. For the above channel, we derive the cut-off volume-to-noise ratio that is required to achieve a good error performance with low decoding complexity. © 2013 IEEE.

The Complete Structure of the Mycobacterium smegmatis 70S Ribosome

Directory of Open Access Journals (Sweden)

Jendrik Hentschel

2017-07-01

Full Text Available The ribosome carries out the synthesis of proteins in every living cell. It consequently represents a frontline target in anti-microbial therapy. Tuberculosis ranks among the leading causes of death worldwide, due in large part to the combination of difficult-to-treat latency and antibiotic resistance. Here, we present the 3.3-Å cryo-EM structure of the 70S ribosome of Mycobacterium smegmatis, a close relative to the human pathogen Mycobacterium tuberculosis. The structure reveals two additional ribosomal proteins and localizes them to the vicinity of drug-target sites in both the catalytic center and the decoding site of the ribosome. Furthermore, we visualized actinobacterium-specific rRNA and protein expansions that extensively remodel the ribosomal surface with implications for polysome organization. Our results provide a foundation for understanding the idiosyncrasies of mycobacterial translation and reveal atomic details of the structure that will facilitate the design of anti-tubercular therapeutics.

The Complete Structure of the Mycobacterium smegmatis 70S Ribosome.

Science.gov (United States)

Hentschel, Jendrik; Burnside, Chloe; Mignot, Ingrid; Leibundgut, Marc; Boehringer, Daniel; Ban, Nenad

2017-07-05

The ribosome carries out the synthesis of proteins in every living cell. It consequently represents a frontline target in anti-microbial therapy. Tuberculosis ranks among the leading causes of death worldwide, due in large part to the combination of difficult-to-treat latency and antibiotic resistance. Here, we present the 3.3-Å cryo-EM structure of the 70S ribosome of Mycobacterium smegmatis, a close relative to the human pathogen Mycobacterium tuberculosis. The structure reveals two additional ribosomal proteins and localizes them to the vicinity of drug-target sites in both the catalytic center and the decoding site of the ribosome. Furthermore, we visualized actinobacterium-specific rRNA and protein expansions that extensively remodel the ribosomal surface with implications for polysome organization. Our results provide a foundation for understanding the idiosyncrasies of mycobacterial translation and reveal atomic details of the structure that will facilitate the design of anti-tubercular therapeutics. Copyright © 2017 The Author(s). Published by Elsevier Inc. All rights reserved.

SYMBOL LEVEL DECODING FOR DUO-BINARY TURBO CODES

Directory of Open Access Journals (Sweden)

Yogesh Beeharry

2017-05-01

Full Text Available This paper investigates the performance of three different symbol level decoding algorithms for Duo-Binary Turbo codes. Explicit details of the computations involved in the three decoding techniques, and a computational complexity analysis are given. Simulation results with different couple lengths, code-rates, and QPSK modulation reveal that the symbol level decoding with bit-level information outperforms the symbol level decoding by 0.1 dB on average in the error floor region. Moreover, a complexity analysis reveals that symbol level decoding with bit-level information reduces the decoding complexity by 19.6 % in terms of the total number of computations required for each half-iteration as compared to symbol level decoding.

Recent results in the decoding of Algebraic geometry codes

DEFF Research Database (Denmark)

Høholdt, Tom; Jensen, Helge Elbrønd; Nielsen, Rasmus Refslund

1998-01-01

We analyse the known decoding algorithms for algebraic geometry codes in the case where the number of errors is [(dFR-1)/2]+1, where dFR is the Feng-Rao distance......We analyse the known decoding algorithms for algebraic geometry codes in the case where the number of errors is [(dFR-1)/2]+1, where dFR is the Feng-Rao distance...

Design and Analysis of Adaptive Message Coding on LDPC Decoder with Faulty Storage

Directory of Open Access Journals (Sweden)

Guangjun Ge

2018-01-01

Full Text Available Unreliable message storage severely degrades the performance of LDPC decoders. This paper discusses the impacts of message errors on LDPC decoders and schemes improving the robustness. Firstly, we develop a discrete density evolution analysis for faulty LDPC decoders, which indicates that protecting the sign bits of messages is effective enough for finite-precision LDPC decoders. Secondly, we analyze the effects of quantization precision loss for static sign bit protection and propose an embedded dynamic coding scheme by adaptively employing the least significant bits (LSBs to protect the sign bits. Thirdly, we give a construction of Hamming product code for the adaptive coding and present low complexity decoding algorithms. Theoretic analysis indicates that the proposed scheme outperforms traditional triple modular redundancy (TMR scheme in decoding both threshold and residual errors, while Monte Carlo simulations show that the performance loss is less than 0.2 dB when the storage error probability varies from 10-3 to 10-4.

Multi-stage decoding of multi-level modulation codes

Science.gov (United States)

Lin, Shu; Kasami, Tadao; Costello, Daniel J., Jr.

1991-01-01

Various types of multi-stage decoding for multi-level modulation codes are investigated. It is shown that if the component codes of a multi-level modulation code and types of decoding at various stages are chosen properly, high spectral efficiency and large coding gain can be achieved with reduced decoding complexity. Particularly, it is shown that the difference in performance between the suboptimum multi-stage soft-decision maximum likelihood decoding of a modulation code and the single-stage optimum soft-decision decoding of the code is very small, only a fraction of dB loss in signal to noise ratio at a bit error rate (BER) of 10(exp -6).

Compact disk error measurements

Science.gov (United States)

Howe, D.; Harriman, K.; Tehranchi, B.

1993-01-01

The objectives of this project are as follows: provide hardware and software that will perform simple, real-time, high resolution (single-byte) measurement of the error burst and good data gap statistics seen by a photoCD player read channel when recorded CD write-once discs of variable quality (i.e., condition) are being read; extend the above system to enable measurement of the hard decision (i.e., 1-bit error flags) and soft decision (i.e., 2-bit error flags) decoding information that is produced/used by the Cross Interleaved - Reed - Solomon - Code (CIRC) block decoder employed in the photoCD player read channel; construct a model that uses data obtained via the systems described above to produce meaningful estimates of output error rates (due to both uncorrected ECC words and misdecoded ECC words) when a CD disc having specific (measured) error statistics is read (completion date to be determined); and check the hypothesis that current adaptive CIRC block decoders are optimized for pressed (DAD/ROM) CD discs. If warranted, do a conceptual design of an adaptive CIRC decoder that is optimized for write-once CD discs.

Error-rate performance analysis of cooperative OFDMA system with decode-and-forward relaying

KAUST Repository

Fareed, Muhammad Mehboob; Uysal, Murat; Tsiftsis, Theodoros A.

2014-01-01

In this paper, we investigate the performance of a cooperative orthogonal frequency-division multiple-access (OFDMA) system with decode-and-forward (DaF) relaying. Specifically, we derive a closed-form approximate symbol-error-rate expression and analyze the achievable diversity orders. Depending on the relay location, a diversity order up to (LSkD + 1) + σ M m = 1 min(LSkRm + 1, LR mD + 1) is available, where M is the number of relays, and LS kD + 1, LSkRm + 1, and LRmD + 1 are the lengths of channel impulse responses of source-to-destination, source-to- mth relay, and mth relay-to-destination links, respectively. Monte Carlo simulation results are also presented to confirm the analytical findings. © 2013 IEEE.

Error-rate performance analysis of cooperative OFDMA system with decode-and-forward relaying

KAUST Repository

Fareed, Muhammad Mehboob

2014-06-01

In this paper, we investigate the performance of a cooperative orthogonal frequency-division multiple-access (OFDMA) system with decode-and-forward (DaF) relaying. Specifically, we derive a closed-form approximate symbol-error-rate expression and analyze the achievable diversity orders. Depending on the relay location, a diversity order up to (LSkD + 1) + σ M m = 1 min(LSkRm + 1, LR mD + 1) is available, where M is the number of relays, and LS kD + 1, LSkRm + 1, and LRmD + 1 are the lengths of channel impulse responses of source-to-destination, source-to- mth relay, and mth relay-to-destination links, respectively. Monte Carlo simulation results are also presented to confirm the analytical findings. © 2013 IEEE.

Progressive Image Transmission Based on Joint Source-Channel Decoding Using Adaptive Sum-Product Algorithm

Directory of Open Access Journals (Sweden)

David G. Daut

2007-03-01

Full Text Available A joint source-channel decoding method is designed to accelerate the iterative log-domain sum-product decoding procedure of LDPC codes as well as to improve the reconstructed image quality. Error resilience modes are used in the JPEG2000 source codec making it possible to provide useful source decoded information to the channel decoder. After each iteration, a tentative decoding is made and the channel decoded bits are then sent to the JPEG2000 decoder. The positions of bits belonging to error-free coding passes are then fed back to the channel decoder. The log-likelihood ratios (LLRs of these bits are then modified by a weighting factor for the next iteration. By observing the statistics of the decoding procedure, the weighting factor is designed as a function of the channel condition. Results show that the proposed joint decoding methods can greatly reduce the number of iterations, and thereby reduce the decoding delay considerably. At the same time, this method always outperforms the nonsource controlled decoding method by up to 3 dB in terms of PSNR.

Progressive Image Transmission Based on Joint Source-Channel Decoding Using Adaptive Sum-Product Algorithm

Directory of Open Access Journals (Sweden)

Liu Weiliang

2007-01-01

Full Text Available A joint source-channel decoding method is designed to accelerate the iterative log-domain sum-product decoding procedure of LDPC codes as well as to improve the reconstructed image quality. Error resilience modes are used in the JPEG2000 source codec making it possible to provide useful source decoded information to the channel decoder. After each iteration, a tentative decoding is made and the channel decoded bits are then sent to the JPEG2000 decoder. The positions of bits belonging to error-free coding passes are then fed back to the channel decoder. The log-likelihood ratios (LLRs of these bits are then modified by a weighting factor for the next iteration. By observing the statistics of the decoding procedure, the weighting factor is designed as a function of the channel condition. Results show that the proposed joint decoding methods can greatly reduce the number of iterations, and thereby reduce the decoding delay considerably. At the same time, this method always outperforms the nonsource controlled decoding method by up to 3 dB in terms of PSNR.

The Unexplored Mechanisms and Regulatory Functions of Ribosomal Translocation

Science.gov (United States)

Alejo, Jose Luis

In every cell, protein synthesis is carried out by the ribosome, a complex macromolecular RNA-protein assembly. Decades of structural and kinetic studies have increased our understanding of ribosome initiation, decoding, translocation and termination. Yet, the underlying mechanism of these fundamental processes has yet to be fully delineated. Hence, the molecular basis of regulation remains obscure. Here, single-molecule fluorescence methods are applied to decipher the mechanism and regulatory roles of the multi-step process of directional substrate translocation on the ribosome that accompanies every round of protein synthesis. In Chapter 1, single-molecule fluorescence resonance energy transfer (smFRET) is introduced as a tool for studying bacterial ribosome translocation. Chapter 2 details the experimental methods. In Chapter 3, the elongation factor G(EF-G)-catalyzed movement of substrates through the ribosome is examined from several perspectives or signals reporting on various degrees of freedom of ribosome dynamics. Two ribosomal states interconvert in the presence of EF-G(GDP), displaying novel head domain motions, until relocking takes place. In Chapter 4, in order to test if the mentioned fluctuations leading to relocking are correlated to the engagement of the P-site by the peptidyl-tRNA, the translocation of miscoded tRNAs is studied. Severe defects in the relocking stages of translocation reveal the correlation between this new stage of translocation and P-site tRNA engagement.

Sequential decoders for large MIMO systems

KAUST Repository

Ali, Konpal S.

2014-05-01

Due to their ability to provide high data rates, multiple-input multiple-output (MIMO) systems have become increasingly popular. Decoding of these systems with acceptable error performance is computationally very demanding. In this paper, we employ the Sequential Decoder using the Fano Algorithm for large MIMO systems. A parameter called the bias is varied to attain different performance-complexity trade-offs. Low values of the bias result in excellent performance but at the expense of high complexity and vice versa for higher bias values. Numerical results are done that show moderate bias values result in a decent performance-complexity trade-off. We also attempt to bound the error by bounding the bias, using the minimum distance of a lattice. The variations in complexity with SNR have an interesting trend that shows room for considerable improvement. Our work is compared against linear decoders (LDs) aided with Element-based Lattice Reduction (ELR) and Complex Lenstra-Lenstra-Lovasz (CLLL) reduction. © 2014 IFIP.

LDPC-based iterative joint source-channel decoding for JPEG2000.

Science.gov (United States)

Pu, Lingling; Wu, Zhenyu; Bilgin, Ali; Marcellin, Michael W; Vasic, Bane

2007-02-01

A framework is proposed for iterative joint source-channel decoding of JPEG2000 codestreams. At the encoder, JPEG2000 is used to perform source coding with certain error-resilience (ER) modes, and LDPC codes are used to perform channel coding. During decoding, the source decoder uses the ER modes to identify corrupt sections of the codestream and provides this information to the channel decoder. Decoding is carried out jointly in an iterative fashion. Experimental results indicate that the proposed method requires fewer iterations and improves overall system performance.

STACK DECODING OF LINEAR BLOCK CODES FOR DISCRETE MEMORYLESS CHANNEL USING TREE DIAGRAM

Directory of Open Access Journals (Sweden)

H. Prashantha Kumar

2012-03-01

Full Text Available The boundaries between block and convolutional codes have become diffused after recent advances in the understanding of the trellis structure of block codes and the tail-biting structure of some convolutional codes. Therefore, decoding algorithms traditionally proposed for decoding convolutional codes have been applied for decoding certain classes of block codes. This paper presents the decoding of block codes using tree structure. Many good block codes are presently known. Several of them have been used in applications ranging from deep space communication to error control in storage systems. But the primary difficulty with applying Viterbi or BCJR algorithms to decode of block codes is that, even though they are optimum decoding methods, the promised bit error rates are not achieved in practice at data rates close to capacity. This is because the decoding effort is fixed and grows with block length, and thus only short block length codes can be used. Therefore, an important practical question is whether a suboptimal realizable soft decision decoding method can be found for block codes. A noteworthy result which provides a partial answer to this question is described in the following sections. This result of near optimum decoding will be used as motivation for the investigation of different soft decision decoding methods for linear block codes which can lead to the development of efficient decoding algorithms. The code tree can be treated as an expanded version of the trellis, where every path is totally distinct from every other path. We have derived the tree structure for (8, 4 and (16, 11 extended Hamming codes and have succeeded in implementing the soft decision stack algorithm to decode them. For the discrete memoryless channel, gains in excess of 1.5dB at a bit error rate of 10-5 with respect to conventional hard decision decoding are demonstrated for these codes.

Multiple-Symbol Decision-Feedback Space-Time Differential Decoding in Fading Channels

Directory of Open Access Journals (Sweden)

Wang Xiaodong

2002-01-01

Full Text Available Space-time differential coding (STDC is an effective technique for exploiting transmitter diversity while it does not require the channel state information at the receiver. However, like conventional differential modulation schemes, it exhibits an error floor in fading channels. In this paper, we develop an STDC decoding technique based on multiple-symbol detection and decision-feedback, which makes use of the second-order statistic of the fading processes and has a very low computational complexity. This decoding method can significantly lower the error floor of the conventional STDC decoding algorithm, especially in fast fading channels. The application of the proposed multiple-symbol decision-feedback STDC decoding technique in orthogonal frequency-division multiplexing (OFDM system is also discussed.

Analysis of Iterated Hard Decision Decoding of Product Codes with Reed-Solomon Component Codes

DEFF Research Database (Denmark)

Justesen, Jørn; Høholdt, Tom

2007-01-01

Products of Reed-Solomon codes are important in applications because they offer a combination of large blocks, low decoding complexity, and good performance. A recent result on random graphs can be used to show that with high probability a large number of errors can be corrected by iterating...... minimum distance decoding. We present an analysis related to density evolution which gives the exact asymptotic value of the decoding threshold and also provides a closed form approximation to the distribution of errors in each step of the decoding of finite length codes....

Performance Analysis of a Decoding Algorithm for Algebraic Geometry Codes

DEFF Research Database (Denmark)

Jensen, Helge Elbrønd; Nielsen, Rasmus Refslund; Høholdt, Tom

1998-01-01

We analyse the known decoding algorithms for algebraic geometry codes in the case where the number of errors is greater than or equal to [(dFR-1)/2]+1, where dFR is the Feng-Rao distance......We analyse the known decoding algorithms for algebraic geometry codes in the case where the number of errors is greater than or equal to [(dFR-1)/2]+1, where dFR is the Feng-Rao distance...

Study of bifurcation behavior of two-dimensional turbo product code decoders

International Nuclear Information System (INIS)

He Yejun; Lau, Francis C.M.; Tse, Chi K.

2008-01-01

Turbo codes, low-density parity-check (LDPC) codes and turbo product codes (TPCs) are high performance error-correction codes which employ iterative algorithms for decoding. Under different conditions, the behaviors of the decoders are different. While the nonlinear dynamical behaviors of turbo code decoders and LDPC decoders have been reported in the literature, the dynamical behavior of TPC decoders is relatively unexplored. In this paper, we investigate the behavior of the iterative algorithm of a two-dimensional TPC decoder when the input signal-to-noise ratio (SNR) varies. The quantity to be measured is the mean square value of the posterior probabilities of the information bits. Unlike turbo decoders or LDPC decoders, TPC decoders do not produce a clear 'waterfall region'. This is mainly because the TPC decoding algorithm does not converge to 'indecisive' fixed points even at very low SNR values

Architecture for time or transform domain decoding of reed-solomon codes

Science.gov (United States)

Shao, Howard M. (Inventor); Truong, Trieu-Kie (Inventor); Hsu, In-Shek (Inventor); Deutsch, Leslie J. (Inventor)

1989-01-01

Two pipeline (255,233) RS decoders, one a time domain decoder and the other a transform domain decoder, use the same first part to develop an errata locator polynomial .tau.(x), and an errata evaluator polynominal A(x). Both the time domain decoder and transform domain decoder have a modified GCD that uses an input multiplexer and an output demultiplexer to reduce the number of GCD cells required. The time domain decoder uses a Chien search and polynomial evaluator on the GCD outputs .tau.(x) and A(x), for the final decoding steps, while the transform domain decoder uses a transform error pattern algorithm operating on .tau.(x) and the initial syndrome computation S(x), followed by an inverse transform algorithm in sequence for the final decoding steps prior to adding the received RS coded message to produce a decoded output message.

Cross-linking of streptomycin to the 16S ribosomal RNA of Escherichia coli

International Nuclear Information System (INIS)

Gravel, M.; Melancon, P.; Barkier-Gingras, L.

1987-01-01

[ 3 H]Dihydrostreptomycin was cross-linked to the 30S ribosomal subunit from Escherichia coli with the bifunctional reagent nitrogen mustard. The cross-linking primarily involved the 16S RNA. To localize the site of cross-linking of streptomycin to the 16S RNA, the authors hybridized RNA labeled with streptomycin to restriction fragments of the 16S RNA gene. Labeled RNA hybridized to DNA fragments corresponding to bases 892-917 and bases 1394-1415. These two segments of the ribosomal RNA must by juxtaposed in the ribosome, since there is a single binding site for streptomycin. This region has been implicated both in the decoding site and in the binding of initiation factor IF-3, indicating its functional importance

Study of bifurcation behavior of two-dimensional turbo product code decoders

Energy Technology Data Exchange (ETDEWEB)

He Yejun [Department of Electronic and Information Engineering, Hong Kong Polytechnic University, Hunghom, Hong Kong (China); Lau, Francis C.M. [Department of Electronic and Information Engineering, Hong Kong Polytechnic University, Hunghom, Hong Kong (China)], E-mail: encmlau@polyu.edu.hk; Tse, Chi K. [Department of Electronic and Information Engineering, Hong Kong Polytechnic University, Hunghom, Hong Kong (China)

2008-04-15

Turbo codes, low-density parity-check (LDPC) codes and turbo product codes (TPCs) are high performance error-correction codes which employ iterative algorithms for decoding. Under different conditions, the behaviors of the decoders are different. While the nonlinear dynamical behaviors of turbo code decoders and LDPC decoders have been reported in the literature, the dynamical behavior of TPC decoders is relatively unexplored. In this paper, we investigate the behavior of the iterative algorithm of a two-dimensional TPC decoder when the input signal-to-noise ratio (SNR) varies. The quantity to be measured is the mean square value of the posterior probabilities of the information bits. Unlike turbo decoders or LDPC decoders, TPC decoders do not produce a clear 'waterfall region'. This is mainly because the TPC decoding algorithm does not converge to 'indecisive' fixed points even at very low SNR values.

Bounded distance decoding of linear error-correcting codes with Gröbner bases

NARCIS (Netherlands)

Bulygin, S.; Pellikaan, G.R.

2009-01-01

The problem of bounded distance decoding of arbitrary linear codes using Gröbner bases is addressed. A new method is proposed, which is based on reducing an initial decoding problem to solving a certain system of polynomial equations over a finite field. The peculiarity of this system is that, when

Multiuser Random Coding Techniques for Mismatched Decoding

OpenAIRE

Scarlett, Jonathan; Martinez, Alfonso; Guillén i Fàbregas, Albert

2016-01-01

This paper studies multiuser random coding techniques for channel coding with a given (possibly suboptimal) decoding rule. For the mismatched discrete memoryless multiple-access channel, an error exponent is obtained that is tight with respect to the ensemble average, and positive within the interior of Lapidoth's achievable rate region. This exponent proves the ensemble tightness of the exponent of Liu and Hughes in the case of maximum-likelihood decoding. An equivalent dual form of Lapidoth...

Multi-stage decoding for multi-level block modulation codes

Science.gov (United States)

Lin, Shu

1991-01-01

In this paper, we investigate various types of multi-stage decoding for multi-level block modulation codes, in which the decoding of a component code at each stage can be either soft-decision or hard-decision, maximum likelihood or bounded-distance. Error performance of codes is analyzed for a memoryless additive channel based on various types of multi-stage decoding, and upper bounds on the probability of an incorrect decoding are derived. Based on our study and computation results, we find that, if component codes of a multi-level modulation code and types of decoding at various stages are chosen properly, high spectral efficiency and large coding gain can be achieved with reduced decoding complexity. In particular, we find that the difference in performance between the suboptimum multi-stage soft-decision maximum likelihood decoding of a modulation code and the single-stage optimum decoding of the overall code is very small: only a fraction of dB loss in SNR at the probability of an incorrect decoding for a block of 10(exp -6). Multi-stage decoding of multi-level modulation codes really offers a way to achieve the best of three worlds, bandwidth efficiency, coding gain, and decoding complexity.

Ribosomal frameshifting and transcriptional slippage: From genetic steganography and cryptography to adventitious use.

Science.gov (United States)

Atkins, John F; Loughran, Gary; Bhatt, Pramod R; Firth, Andrew E; Baranov, Pavel V

2016-09-06

Genetic decoding is not 'frozen' as was earlier thought, but dynamic. One facet of this is frameshifting that often results in synthesis of a C-terminal region encoded by a new frame. Ribosomal frameshifting is utilized for the synthesis of additional products, for regulatory purposes and for translational 'correction' of problem or 'savior' indels. Utilization for synthesis of additional products occurs prominently in the decoding of mobile chromosomal element and viral genomes. One class of regulatory frameshifting of stable chromosomal genes governs cellular polyamine levels from yeasts to humans. In many cases of productively utilized frameshifting, the proportion of ribosomes that frameshift at a shift-prone site is enhanced by specific nascent peptide or mRNA context features. Such mRNA signals, which can be 5' or 3' of the shift site or both, can act by pairing with ribosomal RNA or as stem loops or pseudoknots even with one component being 4 kb 3' from the shift site. Transcriptional realignment at slippage-prone sequences also generates productively utilized products encoded trans-frame with respect to the genomic sequence. This too can be enhanced by nucleic acid structure. Together with dynamic codon redefinition, frameshifting is one of the forms of recoding that enriches gene expression. © The Author(s) 2016. Published by Oxford University Press on behalf of Nucleic Acids Research.

Decoding algorithm for vortex communications receiver

Science.gov (United States)

Kupferman, Judy; Arnon, Shlomi

2018-01-01

Vortex light beams can provide a tremendous alphabet for encoding information. We derive a symbol decoding algorithm for a direct detection matrix detector vortex beam receiver using Laguerre Gauss (LG) modes, and develop a mathematical model of symbol error rate (SER) for this receiver. We compare SER as a function of signal to noise ratio (SNR) for our algorithm and for the Pearson correlation algorithm. To our knowledge, this is the first comprehensive treatment of a decoding algorithm of a matrix detector for an LG receiver.

Error Patterns

NARCIS (Netherlands)

Hoede, C.; Li, Z.

2001-01-01

In coding theory the problem of decoding focuses on error vectors. In the simplest situation code words are $(0,1)$-vectors, as are the received messages and the error vectors. Comparison of a received word with the code words yields a set of error vectors. In deciding on the original code word,

"ON ALGEBRAIC DECODING OF Q-ARY REED-MULLER AND PRODUCT REED-SOLOMON CODES"

Energy Technology Data Exchange (ETDEWEB)

SANTHI, NANDAKISHORE [Los Alamos National Laboratory

2007-01-22

We consider a list decoding algorithm recently proposed by Pellikaan-Wu for q-ary Reed-Muller codes RM{sub q}({ell}, m, n) of length n {le} q{sup m} when {ell} {le} q. A simple and easily accessible correctness proof is given which shows that this algorithm achieves a relative error-correction radius of {tau} {le} (1-{radical}{ell}q{sup m-1}/n). This is an improvement over the proof using one-point Algebraic-Geometric decoding method given in. The described algorithm can be adapted to decode product Reed-Solomon codes. We then propose a new low complexity recursive aJgebraic decoding algorithm for product Reed-Solomon codes and Reed-Muller codes. This algorithm achieves a relative error correction radius of {tau} {le} {Pi}{sub i=1}{sup m} (1 - {radical}k{sub i}/q). This algorithm is then proved to outperform the Pellikaan-Wu algorithm in both complexity and error correction radius over a wide range of code rates.

Potts glass reflection of the decoding threshold for qudit quantum error correcting codes

Science.gov (United States)

Jiang, Yi; Kovalev, Alexey A.; Pryadko, Leonid P.

We map the maximum likelihood decoding threshold for qudit quantum error correcting codes to the multicritical point in generalized Potts gauge glass models, extending the map constructed previously for qubit codes. An n-qudit quantum LDPC code, where a qudit can be involved in up to m stabilizer generators, corresponds to a ℤd Potts model with n interaction terms which can couple up to m spins each. We analyze general properties of the phase diagram of the constructed model, give several bounds on the location of the transitions, bounds on the energy density of extended defects (non-local analogs of domain walls), and discuss the correlation functions which can be used to distinguish different phases in the original and the dual models. This research was supported in part by the Grants: NSF PHY-1415600 (AAK), NSF PHY-1416578 (LPP), and ARO W911NF-14-1-0272 (LPP).

Iterative Decoding of Concatenated Codes: A Tutorial

Directory of Open Access Journals (Sweden)

Phillip A. Regalia

2005-05-01

Full Text Available The turbo decoding algorithm of a decade ago constituted a milestone in error-correction coding for digital communications, and has inspired extensions to generalized receiver topologies, including turbo equalization, turbo synchronization, and turbo CDMA, among others. Despite an accrued understanding of iterative decoding over the years, the “turbo principle” remains elusive to master analytically, thereby inciting interest from researchers outside the communications domain. In this spirit, we develop a tutorial presentation of iterative decoding for parallel and serial concatenated codes, in terms hopefully accessible to a broader audience. We motivate iterative decoding as a computationally tractable attempt to approach maximum-likelihood decoding, and characterize fixed points in terms of a “consensus” property between constituent decoders. We review how the decoding algorithm for both parallel and serial concatenated codes coincides with an alternating projection algorithm, which allows one to identify conditions under which the algorithm indeed converges to a maximum-likelihood solution, in terms of particular likelihood functions factoring into the product of their marginals. The presentation emphasizes a common framework applicable to both parallel and serial concatenated codes.

Understanding Biases in Ribosome Profiling Experiments Reveals Signatures of Translation Dynamics in Yeast.

Directory of Open Access Journals (Sweden)

Jeffrey A Hussmann

2015-12-01

Full Text Available Ribosome profiling produces snapshots of the locations of actively translating ribosomes on messenger RNAs. These snapshots can be used to make inferences about translation dynamics. Recent ribosome profiling studies in yeast, however, have reached contradictory conclusions regarding the average translation rate of each codon. Some experiments have used cycloheximide (CHX to stabilize ribosomes before measuring their positions, and these studies all counterintuitively report a weak negative correlation between the translation rate of a codon and the abundance of its cognate tRNA. In contrast, some experiments performed without CHX report strong positive correlations. To explain this contradiction, we identify unexpected patterns in ribosome density downstream of each type of codon in experiments that use CHX. These patterns are evidence that elongation continues to occur in the presence of CHX but with dramatically altered codon-specific elongation rates. The measured positions of ribosomes in these experiments therefore do not reflect the amounts of time ribosomes spend at each position in vivo. These results suggest that conclusions from experiments in yeast using CHX may need reexamination. In particular, we show that in all such experiments, codons decoded by less abundant tRNAs were in fact being translated more slowly before the addition of CHX disrupted these dynamics.

Joint Decoding of Concatenated VLEC and STTC System

Directory of Open Access Journals (Sweden)

Chen Huijun

2008-01-01

Full Text Available Abstract We consider the decoding of wireless communication systems with both source coding in the application layer and channel coding in the physical layer for high-performance transmission over fading channels. Variable length error correcting codes (VLECs and space time trellis codes (STTCs are used to provide bandwidth efficient data compression as well as coding and diversity gains. At the receiver, an iterative joint source and space time decoding scheme are developed to utilize redundancy in both STTC and VLEC to improve overall decoding performance. Issues such as the inseparable systematic information in the symbol level, the asymmetric trellis structure of VLEC, and information exchange between bit and symbol domains have been considered in the maximum a posteriori probability (MAP decoding algorithm. Simulation results indicate that the developed joint decoding scheme achieves a significant decoding gain over the separate decoding in fading channels, whether or not the channel information is perfectly known at the receiver. Furthermore, how rate allocation between STTC and VLEC affects the performance of the joint source and space-time decoder is investigated. Different systems with a fixed overall information rate are studied. It is shown that for a system with more redundancy dedicated to the source code and a higher order modulation of STTC, the joint decoding yields better performance, though with increased complexity.

Joint Decoding of Concatenated VLEC and STTC System

Directory of Open Access Journals (Sweden)

Huijun Chen

2008-07-01

Full Text Available We consider the decoding of wireless communication systems with both source coding in the application layer and channel coding in the physical layer for high-performance transmission over fading channels. Variable length error correcting codes (VLECs and space time trellis codes (STTCs are used to provide bandwidth efficient data compression as well as coding and diversity gains. At the receiver, an iterative joint source and space time decoding scheme are developed to utilize redundancy in both STTC and VLEC to improve overall decoding performance. Issues such as the inseparable systematic information in the symbol level, the asymmetric trellis structure of VLEC, and information exchange between bit and symbol domains have been considered in the maximum a posteriori probability (MAP decoding algorithm. Simulation results indicate that the developed joint decoding scheme achieves a significant decoding gain over the separate decoding in fading channels, whether or not the channel information is perfectly known at the receiver. Furthermore, how rate allocation between STTC and VLEC affects the performance of the joint source and space-time decoder is investigated. Different systems with a fixed overall information rate are studied. It is shown that for a system with more redundancy dedicated to the source code and a higher order modulation of STTC, the joint decoding yields better performance, though with increased complexity.

Resource Efficient LDPC Decoders for Multimedia Communication

OpenAIRE

Chandrasetty, Vikram Arkalgud; Aziz, Syed Mahfuzul

2013-01-01

Achieving high image quality is an important aspect in an increasing number of wireless multimedia applications. These applications require resource efficient error correction hardware to detect and correct errors introduced by the communication channel. This paper presents an innovative flexible architecture for error correction using Low-Density Parity-Check (LDPC) codes. The proposed partially-parallel decoder architecture utilizes a novel code construction technique based on multi-level H...

Fast Reed-Solomon Decoder

Science.gov (United States)

Liu, K. Y.

1986-01-01

High-speed decoder intended for use with Reed-Solomon (RS) codes of long code length and high error-correcting capability. Design based on algorithm that includes high-radix Fermat transform procedure, which is most efficient for high speeds. RS code in question has code-word length of 256 symbols, of which 224 are information symbols and 32 are redundant.

Belief propagation decoding of quantum channels by passing quantum messages

International Nuclear Information System (INIS)

Renes, Joseph M

2017-01-01

The belief propagation (BP) algorithm is a powerful tool in a wide range of disciplines from statistical physics to machine learning to computational biology, and is ubiquitous in decoding classical error-correcting codes. The algorithm works by passing messages between nodes of the factor graph associated with the code and enables efficient decoding of the channel, in some cases even up to the Shannon capacity. Here we construct the first BP algorithm which passes quantum messages on the factor graph and is capable of decoding the classical–quantum channel with pure state outputs. This gives explicit decoding circuits whose number of gates is quadratic in the code length. We also show that this decoder can be modified to work with polar codes for the pure state channel and as part of a decoder for transmitting quantum information over the amplitude damping channel. These represent the first explicit capacity-achieving decoders for non-Pauli channels. (fast track communication)

Belief propagation decoding of quantum channels by passing quantum messages

Science.gov (United States)

Renes, Joseph M.

2017-07-01

The belief propagation (BP) algorithm is a powerful tool in a wide range of disciplines from statistical physics to machine learning to computational biology, and is ubiquitous in decoding classical error-correcting codes. The algorithm works by passing messages between nodes of the factor graph associated with the code and enables efficient decoding of the channel, in some cases even up to the Shannon capacity. Here we construct the first BP algorithm which passes quantum messages on the factor graph and is capable of decoding the classical-quantum channel with pure state outputs. This gives explicit decoding circuits whose number of gates is quadratic in the code length. We also show that this decoder can be modified to work with polar codes for the pure state channel and as part of a decoder for transmitting quantum information over the amplitude damping channel. These represent the first explicit capacity-achieving decoders for non-Pauli channels.

Effect of mutations in the A site of 16 S rRNA on aminoglycoside antibiotic-ribosome interaction

DEFF Research Database (Denmark)

Recht, M I; Douthwaite, S; Dahlquist, K D

1999-01-01

antibiotics, which also interact with this region of rRNA. Mutations of certain nucleotides in rRNA reduce aminoglycoside binding affinity, as previously demonstrated using a model RNA oligonucleotide system. Here, predictions from the oligonucleotide system were tested in the ribosome by mutation...... for the aminoglycoside paromomycin, whereas no discernible reduction in affinity was observed with 1406 mutant ribosomes. These data are consistent with prior NMR structural determination of aminoglycoside interaction with the decoding region, and further our understanding of how aminoglycoside resistance can...

HCV IRES domain IIb affects the configuration of coding RNA in the 40S subunit's decoding groove.

Science.gov (United States)

Filbin, Megan E; Kieft, Jeffrey S

2011-07-01

Hepatitis C virus (HCV) uses a structured internal ribosome entry site (IRES) RNA to recruit the translation machinery to the viral RNA and begin protein synthesis without the ribosomal scanning process required for canonical translation initiation. Different IRES structural domains are used in this process, which begins with direct binding of the 40S ribosomal subunit to the IRES RNA and involves specific manipulation of the translational machinery. We have found that upon initial 40S subunit binding, the stem-loop domain of the IRES that contains the start codon unwinds and adopts a stable configuration within the subunit's decoding groove. This configuration depends on the sequence and structure of a different stem-loop domain (domain IIb) located far from the start codon in sequence, but spatially proximal in the IRES•40S complex. Mutation of domain IIb results in misconfiguration of the HCV RNA in the decoding groove that includes changes in the placement of the AUG start codon, and a substantial decrease in the ability of the IRES to initiate translation. Our results show that two distal regions of the IRES are structurally communicating at the initial step of 40S subunit binding and suggest that this is an important step in driving protein synthesis.

Grasp movement decoding from premotor and parietal cortex.

Science.gov (United States)

Townsend, Benjamin R; Subasi, Erk; Scherberger, Hansjörg

2011-10-05

Despite recent advances in harnessing cortical motor-related activity to control computer cursors and robotic devices, the ability to decode and execute different grasping patterns remains a major obstacle. Here we demonstrate a simple Bayesian decoder for real-time classification of grip type and wrist orientation in macaque monkeys that uses higher-order planning signals from anterior intraparietal cortex (AIP) and ventral premotor cortex (area F5). Real-time decoding was based on multiunit signals, which had similar tuning properties to cells in previous single-unit recording studies. Maximum decoding accuracy for two grasp types (power and precision grip) and five wrist orientations was 63% (chance level, 10%). Analysis of decoder performance showed that grip type decoding was highly accurate (90.6%), with most errors occurring during orientation classification. In a subsequent off-line analysis, we found small but significant performance improvements (mean, 6.25 percentage points) when using an optimized spike-sorting method (superparamagnetic clustering). Furthermore, we observed significant differences in the contributions of F5 and AIP for grasp decoding, with F5 being better suited for classification of the grip type and AIP contributing more toward decoding of object orientation. However, optimum decoding performance was maximal when using neural activity simultaneously from both areas. Overall, these results highlight quantitative differences in the functional representation of grasp movements in AIP and F5 and represent a first step toward using these signals for developing functional neural interfaces for hand grasping.

Structural insights into methyltransferase KsgA function in 30S ribosomal subunit biogenesis.

Science.gov (United States)

Boehringer, Daniel; O'Farrell, Heather C; Rife, Jason P; Ban, Nenad

2012-03-23

The assembly of the ribosomal subunits is facilitated by ribosome biogenesis factors. The universally conserved methyltransferase KsgA modifies two adjacent adenosine residues in the 3'-terminal helix 45 of the 16 S ribosomal RNA (rRNA). KsgA recognizes its substrate adenosine residues only in the context of a near mature 30S subunit and is required for the efficient processing of the rRNA termini during ribosome biogenesis. Here, we present the cryo-EM structure of KsgA bound to a nonmethylated 30S ribosomal subunit. The structure reveals that KsgA binds to the 30S platform with the catalytic N-terminal domain interacting with substrate adenosine residues in helix 45 and the C-terminal domain making extensive contacts to helix 27 and helix 24. KsgA excludes the penultimate rRNA helix 44 from adopting its position in the mature 30S subunit, blocking the formation of the decoding site and subunit joining. We suggest that the activation of methyltransferase activity and subsequent dissociation of KsgA control conformational changes in helix 44 required for final rRNA processing and translation initiation.

Structural Insights into Methyltransferase KsgA Function in 30S Ribosomal Subunit Biogenesis*

Science.gov (United States)

Boehringer, Daniel; O'Farrell, Heather C.; Rife, Jason P.; Ban, Nenad

2012-01-01

The assembly of the ribosomal subunits is facilitated by ribosome biogenesis factors. The universally conserved methyltransferase KsgA modifies two adjacent adenosine residues in the 3′-terminal helix 45 of the 16 S ribosomal RNA (rRNA). KsgA recognizes its substrate adenosine residues only in the context of a near mature 30S subunit and is required for the efficient processing of the rRNA termini during ribosome biogenesis. Here, we present the cryo-EM structure of KsgA bound to a nonmethylated 30S ribosomal subunit. The structure reveals that KsgA binds to the 30S platform with the catalytic N-terminal domain interacting with substrate adenosine residues in helix 45 and the C-terminal domain making extensive contacts to helix 27 and helix 24. KsgA excludes the penultimate rRNA helix 44 from adopting its position in the mature 30S subunit, blocking the formation of the decoding site and subunit joining. We suggest that the activation of methyltransferase activity and subsequent dissociation of KsgA control conformational changes in helix 44 required for final rRNA processing and translation initiation. PMID:22308031

Evidence for rRNA 2'-O-methylation plasticity: Control of intrinsic translational capabilities of human ribosomes.

Science.gov (United States)

Erales, Jenny; Marchand, Virginie; Panthu, Baptiste; Gillot, Sandra; Belin, Stéphane; Ghayad, Sandra E; Garcia, Maxime; Laforêts, Florian; Marcel, Virginie; Baudin-Baillieu, Agnès; Bertin, Pierre; Couté, Yohann; Adrait, Annie; Meyer, Mélanie; Therizols, Gabriel; Yusupov, Marat; Namy, Olivier; Ohlmann, Théophile; Motorin, Yuri; Catez, Frédéric; Diaz, Jean-Jacques

2017-12-05

Ribosomal RNAs (rRNAs) are main effectors of messenger RNA (mRNA) decoding, peptide-bond formation, and ribosome dynamics during translation. Ribose 2'-O-methylation (2'-O-Me) is the most abundant rRNA chemical modification, and displays a complex pattern in rRNA. 2'-O-Me was shown to be essential for accurate and efficient protein synthesis in eukaryotic cells. However, whether rRNA 2'-O-Me is an adjustable feature of the human ribosome and a means of regulating ribosome function remains to be determined. Here we challenged rRNA 2'-O-Me globally by inhibiting the rRNA methyl-transferase fibrillarin in human cells. Using RiboMethSeq, a nonbiased quantitative mapping of 2'-O-Me, we identified a repertoire of 2'-O-Me sites subjected to variation and demonstrate that functional domains of ribosomes are targets of 2'-O-Me plasticity. Using the cricket paralysis virus internal ribosome entry site element, coupled to in vitro translation, we show that the intrinsic capability of ribosomes to translate mRNAs is modulated through a 2'-O-Me pattern and not by nonribosomal actors of the translational machinery. Our data establish rRNA 2'-O-Me plasticity as a mechanism providing functional specificity to human ribosomes.

Unitary Application of the Quantum Error Correction Codes

International Nuclear Information System (INIS)

You Bo; Xu Ke; Wu Xiaohua

2012-01-01

For applying the perfect code to transmit quantum information over a noise channel, the standard protocol contains four steps: the encoding, the noise channel, the error-correction operation, and the decoding. In present work, we show that this protocol can be simplified. The error-correction operation is not necessary if the decoding is realized by the so-called complete unitary transformation. We also offer a quantum circuit, which can correct the arbitrary single-qubit errors.

Can the BMS Algorithm Decode Up to \\lfloor \\frac{d_G-g-1}{2}\\rfloor Errors? Yes, but with Some Additional Remarks

Science.gov (United States)

Sakata, Shojiro; Fujisawa, Masaya

It is a well-known fact [7], [9] that the BMS algorithm with majority voting can decode up to half the Feng-Rao designed distance dFR. Since dFR is not smaller than the Goppa designed distance dG, that algorithm can correct up to \\lfloor \\frac{d_G-1}{2}\\rfloor errors. On the other hand, it has been considered to be evident that the original BMS algorithm (without voting) [1], [2] can correct up to \\lfloor \\frac{d_G-g-1}{2}\\rfloor errors similarly to the basic algorithm by Skorobogatov-Vladut. But, is it true? In this short paper, we show that it is true, although we need a few remarks and some additional procedures for determining the Groebner basis of the error locator ideal exactly. In fact, as the basic algorithm gives a set of polynomials whose zero set contains the error locators as a subset, it cannot always give the exact error locators, unless the syndrome equation is solved to find the error values in addition.

Efficient algorithms for maximum likelihood decoding in the surface code

Science.gov (United States)

Bravyi, Sergey; Suchara, Martin; Vargo, Alexander

2014-09-01

We describe two implementations of the optimal error correction algorithm known as the maximum likelihood decoder (MLD) for the two-dimensional surface code with a noiseless syndrome extraction. First, we show how to implement MLD exactly in time O (n2), where n is the number of code qubits. Our implementation uses a reduction from MLD to simulation of matchgate quantum circuits. This reduction however requires a special noise model with independent bit-flip and phase-flip errors. Secondly, we show how to implement MLD approximately for more general noise models using matrix product states (MPS). Our implementation has running time O (nχ3), where χ is a parameter that controls the approximation precision. The key step of our algorithm, borrowed from the density matrix renormalization-group method, is a subroutine for contracting a tensor network on the two-dimensional grid. The subroutine uses MPS with a bond dimension χ to approximate the sequence of tensors arising in the course of contraction. We benchmark the MPS-based decoder against the standard minimum weight matching decoder observing a significant reduction of the logical error probability for χ ≥4.

An FPGA Implementation of (3,6-Regular Low-Density Parity-Check Code Decoder

Directory of Open Access Journals (Sweden)

Tong Zhang

2003-05-01

Full Text Available Because of their excellent error-correcting performance, low-density parity-check (LDPC codes have recently attracted a lot of attention. In this paper, we are interested in the practical LDPC code decoder hardware implementations. The direct fully parallel decoder implementation usually incurs too high hardware complexity for many real applications, thus partly parallel decoder design approaches that can achieve appropriate trade-offs between hardware complexity and decoding throughput are highly desirable. Applying a joint code and decoder design methodology, we develop a high-speed (3,k-regular LDPC code partly parallel decoder architecture based on which we implement a 9216-bit, rate-1/2(3,6-regular LDPC code decoder on Xilinx FPGA device. This partly parallel decoder supports a maximum symbol throughput of 54 Mbps and achieves BER 10−6 at 2 dB over AWGN channel while performing maximum 18 decoding iterations.

tRNA's wobble decoding of the genome: 40 years of modification.

Science.gov (United States)

Agris, Paul F; Vendeix, Franck A P; Graham, William D

2007-02-09

The genetic code is degenerate, in that 20 amino acids are encoded by 61 triplet codes. In 1966, Francis Crick hypothesized that the cell's limited number of tRNAs decoded the genome by recognizing more than one codon. The ambiguity of that recognition resided in the third base-pair, giving rise to the Wobble Hypothesis. Post-transcriptional modifications at tRNA's wobble position 34, especially modifications of uridine 34, enable wobble to occur. The Modified Wobble Hypothesis proposed in 1991 that specific modifications of a tRNA wobble nucleoside shape the anticodon architecture in such a manner that interactions were restricted to the complementary base plus a single wobble pairing for amino acids with twofold degenerate codons. However, chemically different modifications at position 34 would expand the ability of a tRNA to read three or even four of the fourfold degenerate codons. One foundation of Crick's Wobble Hypothesis was that a near-constant geometry of canonical base-pairing be maintained in forming all three base-pairs between the tRNA anticodon and mRNA codon on the ribosome. In accepting an aminoacyl-tRNA, the ribosome requires maintenance of a specific geometry for the anticodon-codon base-pairing. However, it is the post-transcriptional modifications at tRNA wobble position 34 and purine 37, 3'-adjacent to the anticodon, that pre-structure the anticodon domain to ensure the correct codon binding. The modifications create both the architecture and the stability needed for decoding through restraints on anticodon stereochemistry and conformational space, and through selective hydrogen bonding. A physicochemical understanding of modified nucleoside contributions to the tRNA anticodon domain architecture and its decoding of the genome has advanced RNA world evolutionary theory, the principles of RNA chemistry, and the application of this knowledge to the introduction of new amino acids to proteins.

Implementation of Layered Decoding Architecture for LDPC Code using Layered Min-Sum Algorithm

Directory of Open Access Journals (Sweden)

Sandeep Kakde

2017-12-01

Full Text Available For binary field and long code lengths, Low Density Parity Check (LDPC code approaches Shannon limit performance. LDPC codes provide remarkable error correction performance and therefore enlarge the design space for communication systems.In this paper, we have compare different digital modulation techniques and found that BPSK modulation technique is better than other modulation techniques in terms of BER. It also gives error performance of LDPC decoder over AWGN channel using Min-Sum algorithm. VLSI Architecture is proposed which uses the value re-use property of min-sum algorithm and gives high throughput. The proposed work has been implemented and tested on Xilinx Virtex 5 FPGA. The MATLAB result of LDPC decoder for low bit error rate (BER gives bit error rate in the range of 10-1 to 10-3.5 at SNR=1 to 2 for 20 no of iterations. So it gives good bit error rate performance. The latency of the parallel design of LDPC decoder has also reduced. It has accomplished 141.22 MHz maximum frequency and throughput of 2.02 Gbps while consuming less area of the design.

Logical error rate scaling of the toric code

International Nuclear Information System (INIS)

Watson, Fern H E; Barrett, Sean D

2014-01-01

To date, a great deal of attention has focused on characterizing the performance of quantum error correcting codes via their thresholds, the maximum correctable physical error rate for a given noise model and decoding strategy. Practical quantum computers will necessarily operate below these thresholds meaning that other performance indicators become important. In this work we consider the scaling of the logical error rate of the toric code and demonstrate how, in turn, this may be used to calculate a key performance indicator. We use a perfect matching decoding algorithm to find the scaling of the logical error rate and find two distinct operating regimes. The first regime admits a universal scaling analysis due to a mapping to a statistical physics model. The second regime characterizes the behaviour in the limit of small physical error rate and can be understood by counting the error configurations leading to the failure of the decoder. We present a conjecture for the ranges of validity of these two regimes and use them to quantify the overhead—the total number of physical qubits required to perform error correction. (paper)

Performance analysis of a decoding algorithm for algebraic-geometry codes

DEFF Research Database (Denmark)

Høholdt, Tom; Jensen, Helge Elbrønd; Nielsen, Rasmus Refslund

1999-01-01

The fast decoding algorithm for one point algebraic-geometry codes of Sakata, Elbrond Jensen, and Hoholdt corrects all error patterns of weight less than half the Feng-Rao minimum distance. In this correspondence we analyze the performance of the algorithm for heavier error patterns. It turns out...

Low Complexity List Decoding for Polar Codes with Multiple CRC Codes

Directory of Open Access Journals (Sweden)

Jong-Hwan Kim

2017-04-01

Full Text Available Polar codes are the first family of error correcting codes that provably achieve the capacity of symmetric binary-input discrete memoryless channels with low complexity. Since the development of polar codes, there have been many studies to improve their finite-length performance. As a result, polar codes are now adopted as a channel code for the control channel of 5G new radio of the 3rd generation partnership project. However, the decoder implementation is one of the big practical problems and low complexity decoding has been studied. This paper addresses a low complexity successive cancellation list decoding for polar codes utilizing multiple cyclic redundancy check (CRC codes. While some research uses multiple CRC codes to reduce memory and time complexity, we consider the operational complexity of decoding, and reduce it by optimizing CRC positions in combination with a modified decoding operation. Resultingly, the proposed scheme obtains not only complexity reduction from early stopping of decoding, but also additional reduction from the reduced number of decoding paths.

Sum of the Magnitude for Hard Decision Decoding Algorithm Based on Loop Update Detection

Science.gov (United States)

Meng, Jiahui; Zhao, Danfeng; Tian, Hai; Zhang, Liang

2018-01-01

In order to improve the performance of non-binary low-density parity check codes (LDPC) hard decision decoding algorithm and to reduce the complexity of decoding, a sum of the magnitude for hard decision decoding algorithm based on loop update detection is proposed. This will also ensure the reliability, stability and high transmission rate of 5G mobile communication. The algorithm is based on the hard decision decoding algorithm (HDA) and uses the soft information from the channel to calculate the reliability, while the sum of the variable nodes’ (VN) magnitude is excluded for computing the reliability of the parity checks. At the same time, the reliability information of the variable node is considered and the loop update detection algorithm is introduced. The bit corresponding to the error code word is flipped multiple times, before this is searched in the order of most likely error probability to finally find the correct code word. Simulation results show that the performance of one of the improved schemes is better than the weighted symbol flipping (WSF) algorithm under different hexadecimal numbers by about 2.2 dB and 2.35 dB at the bit error rate (BER) of 10−5 over an additive white Gaussian noise (AWGN) channel, respectively. Furthermore, the average number of decoding iterations is significantly reduced. PMID:29342963

Sum of the Magnitude for Hard Decision Decoding Algorithm Based on Loop Update Detection.

Science.gov (United States)

Meng, Jiahui; Zhao, Danfeng; Tian, Hai; Zhang, Liang

2018-01-15

In order to improve the performance of non-binary low-density parity check codes (LDPC) hard decision decoding algorithm and to reduce the complexity of decoding, a sum of the magnitude for hard decision decoding algorithm based on loop update detection is proposed. This will also ensure the reliability, stability and high transmission rate of 5G mobile communication. The algorithm is based on the hard decision decoding algorithm (HDA) and uses the soft information from the channel to calculate the reliability, while the sum of the variable nodes' (VN) magnitude is excluded for computing the reliability of the parity checks. At the same time, the reliability information of the variable node is considered and the loop update detection algorithm is introduced. The bit corresponding to the error code word is flipped multiple times, before this is searched in the order of most likely error probability to finally find the correct code word. Simulation results show that the performance of one of the improved schemes is better than the weighted symbol flipping (WSF) algorithm under different hexadecimal numbers by about 2.2 dB and 2.35 dB at the bit error rate (BER) of 10 -5 over an additive white Gaussian noise (AWGN) channel, respectively. Furthermore, the average number of decoding iterations is significantly reduced.

Sum of the Magnitude for Hard Decision Decoding Algorithm Based on Loop Update Detection

Directory of Open Access Journals (Sweden)

Jiahui Meng

2018-01-01

Full Text Available In order to improve the performance of non-binary low-density parity check codes (LDPC hard decision decoding algorithm and to reduce the complexity of decoding, a sum of the magnitude for hard decision decoding algorithm based on loop update detection is proposed. This will also ensure the reliability, stability and high transmission rate of 5G mobile communication. The algorithm is based on the hard decision decoding algorithm (HDA and uses the soft information from the channel to calculate the reliability, while the sum of the variable nodes’ (VN magnitude is excluded for computing the reliability of the parity checks. At the same time, the reliability information of the variable node is considered and the loop update detection algorithm is introduced. The bit corresponding to the error code word is flipped multiple times, before this is searched in the order of most likely error probability to finally find the correct code word. Simulation results show that the performance of one of the improved schemes is better than the weighted symbol flipping (WSF algorithm under different hexadecimal numbers by about 2.2 dB and 2.35 dB at the bit error rate (BER of 10−5 over an additive white Gaussian noise (AWGN channel, respectively. Furthermore, the average number of decoding iterations is significantly reduced.

Genome-wide polysomal analysis of a yeast strain with mutated ribosomal protein S9

Directory of Open Access Journals (Sweden)

Arava Yoav

2007-08-01

Full Text Available Abstract Background The yeast ribosomal protein S9 (S9 is located at the entrance tunnel of the mRNA into the ribosome. It is known to play a role in accurate decoding and its bacterial homolog (S4 has recently been shown to be involved in opening RNA duplexes. Here we examined the effects of changing the C terminus of S9, which is rich in acidic amino acids and extends out of the ribosome surface. Results We performed a genome-wide analysis to reveal effects at the transcription and translation levels of all yeast genes. While negligible relative changes were observed in steady-state mRNA levels, a significant number of mRNAs appeared to have altered ribosomal density. Notably, 40% of the genes having reliable signals changed their ribosomal association by more than one ribosome. Yet, no general correlations with physical or functional features of the mRNA were observed. Ribosome Density Mapping (RDM along four of the mRNAs with increased association revealed an increase in ribosomal density towards the end of the coding region for at least two of them. Read-through analysis did not reveal any increase in read-through of a premature stop codon by the mutant strain. Conclusion The ribosomal protein rpS9 appears to be involved in the translation of many mRNAs, since altering its C terminus led to a significant change in ribosomal association of many mRNAs. We did not find strong correlations between these changes and several physical features of the mRNA, yet future studies with advanced tools may allow such correlations to be determined. Importantly, our results indicate an accumulation of ribosomes towards the end of the coding regions of some mRNAs. This suggests an involvement of S9 in ribosomal dissociation during translation termination.

Robust pattern decoding in shape-coded structured light

Science.gov (United States)

Tang, Suming; Zhang, Xu; Song, Zhan; Song, Lifang; Zeng, Hai

2017-09-01

Decoding is a challenging and complex problem in a coded structured light system. In this paper, a robust pattern decoding method is proposed for the shape-coded structured light in which the pattern is designed as grid shape with embedded geometrical shapes. In our decoding method, advancements are made at three steps. First, a multi-template feature detection algorithm is introduced to detect the feature point which is the intersection of each two orthogonal grid-lines. Second, pattern element identification is modelled as a supervised classification problem and the deep neural network technique is applied for the accurate classification of pattern elements. Before that, a training dataset is established, which contains a mass of pattern elements with various blurring and distortions. Third, an error correction mechanism based on epipolar constraint, coplanarity constraint and topological constraint is presented to reduce the false matches. In the experiments, several complex objects including human hand are chosen to test the accuracy and robustness of the proposed method. The experimental results show that our decoding method not only has high decoding accuracy, but also owns strong robustness to surface color and complex textures.

High-speed architecture for the decoding of trellis-coded modulation

Science.gov (United States)

Osborne, William P.

1992-01-01

Since 1971, when the Viterbi Algorithm was introduced as the optimal method of decoding convolutional codes, improvements in circuit technology, especially VLSI, have steadily increased its speed and practicality. Trellis-Coded Modulation (TCM) combines convolutional coding with higher level modulation (non-binary source alphabet) to provide forward error correction and spectral efficiency. For binary codes, the current stare-of-the-art is a 64-state Viterbi decoder on a single CMOS chip, operating at a data rate of 25 Mbps. Recently, there has been an interest in increasing the speed of the Viterbi Algorithm by improving the decoder architecture, or by reducing the algorithm itself. Designs employing new architectural techniques are now in existence, however these techniques are currently applied to simpler binary codes, not to TCM. The purpose of this report is to discuss TCM architectural considerations in general, and to present the design, at the logic gate level, or a specific TCM decoder which applies these considerations to achieve high-speed decoding.

A new LDPC decoding scheme for PDM-8QAM BICM coherent optical communication system

Science.gov (United States)

Liu, Yi; Zhang, Wen-bo; Xi, Li-xia; Tang, Xian-feng; Zhang, Xiao-guang

2015-11-01

A new log-likelihood ratio (LLR) message estimation method is proposed for polarization-division multiplexing eight quadrature amplitude modulation (PDM-8QAM) bit-interleaved coded modulation (BICM) optical communication system. The formulation of the posterior probability is theoretically analyzed, and the way to reduce the pre-decoding bit error rate ( BER) of the low density parity check (LDPC) decoder for PDM-8QAM constellations is presented. Simulation results show that it outperforms the traditional scheme, i.e., the new post-decoding BER is decreased down to 50% of that of the traditional post-decoding algorithm.

MATHEMATICAL AND COMPUTATIONAL MODELLING OF RIBOSOMAL MOVEMENT AND PROTEIN SYNTHESIS: AN OVERVIEW

Directory of Open Access Journals (Sweden)

Tobias von der Haar

2012-04-01

Full Text Available Translation or protein synthesis consists of a complex system of chemical reactions, which ultimately result in decoding of the mRNA and the production of a protein. The complexity of this reaction system makes it difficult to quantitatively connect its input parameters (such as translation factor or ribosome concentrations, codon composition of the mRNA, or energy availability to output parameters (such as protein synthesis rates or ribosome densities on mRNAs. Mathematical and computational models of translation have now been used for nearly five decades to investigate translation, and to shed light on the relationship between the different reactions in the system. This review gives an overview over the principal approaches used in the modelling efforts, and summarises some of the major findings that were made.

Fast Transform Decoding Of Nonsystematic Reed-Solomon Codes

Science.gov (United States)

Truong, Trieu-Kie; Cheung, Kar-Ming; Shiozaki, A.; Reed, Irving S.

1992-01-01

Fast, efficient Fermat number transform used to compute F'(x) analogous to computation of syndrome in conventional decoding scheme. Eliminates polynomial multiplications and reduces number of multiplications in reconstruction of F'(x) to n log (n). Euclidean algorithm used to evaluate F(x) directly, without going through intermediate steps of solving error-locator and error-evaluator polynomials. Algorithm suitable for implementation in very-large-scale integrated circuits.

Hardware Implementation of A Non-RLL Soft-decoding Beacon-based Visible Light Communication Receiver

OpenAIRE

Nguyen, Duc-Phuc; Le, Dinh-Dung; Tran, Thi-Hong; Huynh, Huu-Thuan; Nakashima, Yasuhiko

2018-01-01

Visible light communication (VLC)-based beacon systems, which usually transmit identification (ID) information in small-size data frames are applied widely in indoor localization applications. There is one fact that flicker of LED light should be avoid in any VLC systems. Current flicker mitigation solutions based on run-length limited (RLL) codes suffer from reduced code rates, or are limited to hard-decoding forward error correction (FEC) decoders. Recently, soft-decoding techniques of RLL-...

Tensor Networks and Quantum Error Correction

Science.gov (United States)

Ferris, Andrew J.; Poulin, David

2014-07-01

We establish several relations between quantum error correction (QEC) and tensor network (TN) methods of quantum many-body physics. We exhibit correspondences between well-known families of QEC codes and TNs, and demonstrate a formal equivalence between decoding a QEC code and contracting a TN. We build on this equivalence to propose a new family of quantum codes and decoding algorithms that generalize and improve upon quantum polar codes and successive cancellation decoding in a natural way.

The ribosome uses two active mechanisms to unwind messenger RNA during translation.

Science.gov (United States)

Qu, Xiaohui; Wen, Jin-Der; Lancaster, Laura; Noller, Harry F; Bustamante, Carlos; Tinoco, Ignacio

2011-07-06

The ribosome translates the genetic information encoded in messenger RNA into protein. Folded structures in the coding region of an mRNA represent a kinetic barrier that lowers the peptide elongation rate, as the ribosome must disrupt structures it encounters in the mRNA at its entry site to allow translocation to the next codon. Such structures are exploited by the cell to create diverse strategies for translation regulation, such as programmed frameshifting, the modulation of protein expression levels, ribosome localization and co-translational protein folding. Although strand separation activity is inherent to the ribosome, requiring no exogenous helicases, its mechanism is still unknown. Here, using a single-molecule optical tweezers assay on mRNA hairpins, we find that the translation rate of identical codons at the decoding centre is greatly influenced by the GC content of folded structures at the mRNA entry site. Furthermore, force applied to the ends of the hairpin to favour its unfolding significantly speeds translation. Quantitative analysis of the force dependence of its helicase activity reveals that the ribosome, unlike previously studied helicases, uses two distinct active mechanisms to unwind mRNA structure: it destabilizes the helical junction at the mRNA entry site by biasing its thermal fluctuations towards the open state, increasing the probability of the ribosome translocating unhindered; and it mechanically pulls apart the mRNA single strands of the closed junction during the conformational changes that accompany ribosome translocation. The second of these mechanisms ensures a minimal basal rate of translation in the cell; specialized, mechanically stable structures are required to stall the ribosome temporarily. Our results establish a quantitative mechanical basis for understanding the mechanism of regulation of the elongation rate of translation by structured mRNAs. ©2011 Macmillan Publishers Limited. All rights reserved

Linear-time general decoding algorithm for the surface code

Science.gov (United States)

Darmawan, Andrew S.; Poulin, David

2018-05-01

A quantum error correcting protocol can be substantially improved by taking into account features of the physical noise process. We present an efficient decoder for the surface code which can account for general noise features, including coherences and correlations. We demonstrate that the decoder significantly outperforms the conventional matching algorithm on a variety of noise models, including non-Pauli noise and spatially correlated noise. The algorithm is based on an approximate calculation of the logical channel using a tensor-network description of the noisy state.

Analysis and Design of Binary Message-Passing Decoders

DEFF Research Database (Denmark)

Lechner, Gottfried; Pedersen, Troels; Kramer, Gerhard

2012-01-01

Binary message-passing decoders for low-density parity-check (LDPC) codes are studied by using extrinsic information transfer (EXIT) charts. The channel delivers hard or soft decisions and the variable node decoder performs all computations in the L-value domain. A hard decision channel results...... message-passing decoders. Finally, it is shown that errors on cycles consisting only of degree two and three variable nodes cannot be corrected and a necessary and sufficient condition for the existence of a cycle-free subgraph is derived....... in the well-know Gallager B algorithm, and increasing the output alphabet from hard decisions to two bits yields a gain of more than 1.0 dB in the required signal to noise ratio when using optimized codes. The code optimization requires adapting the mixing property of EXIT functions to the case of binary...

Comparison of rate one-half, equivalent constraint length 24, binary convolutional codes for use with sequential decoding on the deep-space channel

Science.gov (United States)

Massey, J. L.

1976-01-01

Virtually all previously-suggested rate 1/2 binary convolutional codes with KE = 24 are compared. Their distance properties are given; and their performance, both in computation and in error probability, with sequential decoding on the deep-space channel is determined by simulation. Recommendations are made both for the choice of a specific KE = 24 code as well as for codes to be included in future coding standards for the deep-space channel. A new result given in this report is a method for determining the statistical significance of error probability data when the error probability is so small that it is not feasible to perform enough decoding simulations to obtain more than a very small number of decoding errors.

Improved Iterative Hard- and Soft-Reliability Based Majority-Logic Decoding Algorithms for Non-Binary Low-Density Parity-Check Codes

Science.gov (United States)

Xiong, Chenrong; Yan, Zhiyuan

2014-10-01

Non-binary low-density parity-check (LDPC) codes have some advantages over their binary counterparts, but unfortunately their decoding complexity is a significant challenge. The iterative hard- and soft-reliability based majority-logic decoding algorithms are attractive for non-binary LDPC codes, since they involve only finite field additions and multiplications as well as integer operations and hence have significantly lower complexity than other algorithms. In this paper, we propose two improvements to the majority-logic decoding algorithms. Instead of the accumulation of reliability information in the existing majority-logic decoding algorithms, our first improvement is a new reliability information update. The new update not only results in better error performance and fewer iterations on average, but also further reduces computational complexity. Since existing majority-logic decoding algorithms tend to have a high error floor for codes whose parity check matrices have low column weights, our second improvement is a re-selection scheme, which leads to much lower error floors, at the expense of more finite field operations and integer operations, by identifying periodic points, re-selecting intermediate hard decisions, and changing reliability information.

Techniques and Architectures for Hazard-Free Semi-Parallel Decoding of LDPC Codes

Directory of Open Access Journals (Sweden)

Rovini Massimo

2009-01-01

Full Text Available The layered decoding algorithm has recently been proposed as an efficient means for the decoding of low-density parity-check (LDPC codes, thanks to the remarkable improvement in the convergence speed (2x of the decoding process. However, pipelined semi-parallel decoders suffer from violations or "hazards" between consecutive updates, which not only violate the layered principle but also enforce the loops in the code, thus spoiling the error correction performance. This paper describes three different techniques to properly reschedule the decoding updates, based on the careful insertion of "idle" cycles, to prevent the hazards of the pipeline mechanism. Also, different semi-parallel architectures of a layered LDPC decoder suitable for use with such techniques are analyzed. Then, taking the LDPC codes for the wireless local area network (IEEE 802.11n as a case study, a detailed analysis of the performance attained with the proposed techniques and architectures is reported, and results of the logic synthesis on a 65 nm low-power CMOS technology are shown.

Statistical mechanics of error-correcting codes

Science.gov (United States)

Kabashima, Y.; Saad, D.

1999-01-01

We investigate the performance of error-correcting codes, where the code word comprises products of K bits selected from the original message and decoding is carried out utilizing a connectivity tensor with C connections per index. Shannon's bound for the channel capacity is recovered for large K and zero temperature when the code rate K/C is finite. Close to optimal error-correcting capability is obtained for finite K and C. We examine the finite-temperature case to assess the use of simulated annealing for decoding and extend the analysis to accommodate other types of noisy channels.

Video encoder/decoder for encoding/decoding motion compensated images

NARCIS (Netherlands)

1996-01-01

Video encoder and decoder, provided with a motion compensator for motion-compensated video coding or decoding in which a picture is coded or decoded in blocks in alternately horizontal and vertical steps. The motion compensator is provided with addressing means (160) and controlled multiplexers

Instanton-based techniques for analysis and reduction of error floors of LDPC codes

International Nuclear Information System (INIS)

Chertkov, Michael; Chilappagari, Shashi K.; Stepanov, Mikhail G.; Vasic, Bane

2008-01-01

We describe a family of instanton-based optimization methods developed recently for the analysis of the error floors of low-density parity-check (LDPC) codes. Instantons are the most probable configurations of the channel noise which result in decoding failures. We show that the general idea and the respective optimization technique are applicable broadly to a variety of channels, discrete or continuous, and variety of sub-optimal decoders. Specifically, we consider: iterative belief propagation (BP) decoders, Gallager type decoders, and linear programming (LP) decoders performing over the additive white Gaussian noise channel (AWGNC) and the binary symmetric channel (BSC). The instanton analysis suggests that the underlying topological structures of the most probable instanton of the same code but different channels and decoders are related to each other. Armed with this understanding of the graphical structure of the instanton and its relation to the decoding failures, we suggest a method to construct codes whose Tanner graphs are free of these structures, and thus have less significant error floors.

Instanton-based techniques for analysis and reduction of error floor of LDPC codes

Energy Technology Data Exchange (ETDEWEB)

Chertkov, Michael [Los Alamos National Laboratory; Chilappagari, Shashi K [Los Alamos National Laboratory; Stepanov, Mikhail G [Los Alamos National Laboratory; Vasic, Bane [SENIOR MEMBER, IEEE

2008-01-01

We describe a family of instanton-based optimization methods developed recently for the analysis of the error floors of low-density parity-check (LDPC) codes. Instantons are the most probable configurations of the channel noise which result in decoding failures. We show that the general idea and the respective optimization technique are applicable broadly to a variety of channels, discrete or continuous, and variety of sub-optimal decoders. Specifically, we consider: iterative belief propagation (BP) decoders, Gallager type decoders, and linear programming (LP) decoders performing over the additive white Gaussian noise channel (AWGNC) and the binary symmetric channel (BSC). The instanton analysis suggests that the underlying topological structures of the most probable instanton of the same code but different channels and decoders are related to each other. Armed with this understanding of the graphical structure of the instanton and its relation to the decoding failures, we suggest a method to construct codes whose Tanner graphs are free of these structures, and thus have less significant error floors.

Error-correction coding for digital communications

Science.gov (United States)

Clark, G. C., Jr.; Cain, J. B.

This book is written for the design engineer who must build the coding and decoding equipment and for the communication system engineer who must incorporate this equipment into a system. It is also suitable as a senior-level or first-year graduate text for an introductory one-semester course in coding theory. Fundamental concepts of coding are discussed along with group codes, taking into account basic principles, practical constraints, performance computations, coding bounds, generalized parity check codes, polynomial codes, and important classes of group codes. Other topics explored are related to simple nonalgebraic decoding techniques for group codes, soft decision decoding of block codes, algebraic techniques for multiple error correction, the convolutional code structure and Viterbi decoding, syndrome decoding techniques, and sequential decoding techniques. System applications are also considered, giving attention to concatenated codes, coding for the white Gaussian noise channel, interleaver structures for coded systems, and coding for burst noise channels.

Performance Analysis of Iterative Decoding Algorithms for PEG LDPC Codes in Nakagami Fading Channels

Directory of Open Access Journals (Sweden)

O. Al Rasheed

2013-11-01

Full Text Available In this paper we give a comparative analysis of decoding algorithms of Low Density Parity Check (LDPC codes in a channel with the Nakagami distribution of the fading envelope. We consider the Progressive Edge-Growth (PEG method and Improved PEG method for the parity check matrix construction, which can be used to avoid short girths, small trapping sets and a high level of error floor. A comparative analysis of several classes of LDPC codes in various propagation conditions and decoded using different decoding algorithms is also presented.

Adaptive Combined Source and Channel Decoding with Modulation ...

African Journals Online (AJOL)

In this paper, an adaptive system employing combined source and channel decoding with modulation is proposed for slow Rayleigh fading channels. Huffman code is used as the source code and Convolutional code is used for error control. The adaptive scheme employs a family of Convolutional codes of different rates ...

On minimizing the maximum broadcast decoding delay for instantly decodable network coding

KAUST Repository

Douik, Ahmed S.

2014-09-01

In this paper, we consider the problem of minimizing the maximum broadcast decoding delay experienced by all the receivers of generalized instantly decodable network coding (IDNC). Unlike the sum decoding delay, the maximum decoding delay as a definition of delay for IDNC allows a more equitable distribution of the delays between the different receivers and thus a better Quality of Service (QoS). In order to solve this problem, we first derive the expressions for the probability distributions of maximum decoding delay increments. Given these expressions, we formulate the problem as a maximum weight clique problem in the IDNC graph. Although this problem is known to be NP-hard, we design a greedy algorithm to perform effective packet selection. Through extensive simulations, we compare the sum decoding delay and the max decoding delay experienced when applying the policies to minimize the sum decoding delay and our policy to reduce the max decoding delay. Simulations results show that our policy gives a good agreement among all the delay aspects in all situations and outperforms the sum decoding delay policy to effectively minimize the sum decoding delay when the channel conditions become harsher. They also show that our definition of delay significantly improve the number of served receivers when they are subject to strict delay constraints.

An information-theoretic approach to motor action decoding with a reconfigurable parallel architecture.

Science.gov (United States)

Craciun, Stefan; Brockmeier, Austin J; George, Alan D; Lam, Herman; Príncipe, José C

2011-01-01

Methods for decoding movements from neural spike counts using adaptive filters often rely on minimizing the mean-squared error. However, for non-Gaussian distribution of errors, this approach is not optimal for performance. Therefore, rather than using probabilistic modeling, we propose an alternate non-parametric approach. In order to extract more structure from the input signal (neuronal spike counts) we propose using minimum error entropy (MEE), an information-theoretic approach that minimizes the error entropy as part of an iterative cost function. However, the disadvantage of using MEE as the cost function for adaptive filters is the increase in computational complexity. In this paper we present a comparison between the decoding performance of the analytic Wiener filter and a linear filter trained with MEE, which is then mapped to a parallel architecture in reconfigurable hardware tailored to the computational needs of the MEE filter. We observe considerable speedup from the hardware design. The adaptation of filter weights for the multiple-input, multiple-output linear filters, necessary in motor decoding, is a highly parallelizable algorithm. It can be decomposed into many independent computational blocks with a parallel architecture readily mapped to a field-programmable gate array (FPGA) and scales to large numbers of neurons. By pipelining and parallelizing independent computations in the algorithm, the proposed parallel architecture has sublinear increases in execution time with respect to both window size and filter order.

On minimizing the maximum broadcast decoding delay for instantly decodable network coding

KAUST Repository

Douik, Ahmed S.; Sorour, Sameh; Alouini, Mohamed-Slim; Ai-Naffouri, Tareq Y.

2014-01-01

In this paper, we consider the problem of minimizing the maximum broadcast decoding delay experienced by all the receivers of generalized instantly decodable network coding (IDNC). Unlike the sum decoding delay, the maximum decoding delay as a

Error floor behavior study of LDPC codes for concatenated codes design

Science.gov (United States)

Chen, Weigang; Yin, Liuguo; Lu, Jianhua

2007-11-01

Error floor behavior of low-density parity-check (LDPC) codes using quantized decoding algorithms is statistically studied with experimental results on a hardware evaluation platform. The results present the distribution of the residual errors after decoding failure and reveal that the number of residual error bits in a codeword is usually very small using quantized sum-product (SP) algorithm. Therefore, LDPC code may serve as the inner code in a concatenated coding system with a high code rate outer code and thus an ultra low error floor can be achieved. This conclusion is also verified by the experimental results.

Machine-learning-assisted correction of correlated qubit errors in a topological code

Directory of Open Access Journals (Sweden)

Paul Baireuther

2018-01-01

Full Text Available A fault-tolerant quantum computation requires an efficient means to detect and correct errors that accumulate in encoded quantum information. In the context of machine learning, neural networks are a promising new approach to quantum error correction. Here we show that a recurrent neural network can be trained, using only experimentally accessible data, to detect errors in a widely used topological code, the surface code, with a performance above that of the established minimum-weight perfect matching (or blossom decoder. The performance gain is achieved because the neural network decoder can detect correlations between bit-flip (X and phase-flip (Z errors. The machine learning algorithm adapts to the physical system, hence no noise model is needed. The long short-term memory layers of the recurrent neural network maintain their performance over a large number of quantum error correction cycles, making it a practical decoder for forthcoming experimental realizations of the surface code.

Analysis of Minimal LDPC Decoder System on a Chip Implementation

Directory of Open Access Journals (Sweden)

T. Palenik

2015-09-01

Full Text Available This paper presents a practical method of potential replacement of several different Quasi-Cyclic Low-Density Parity-Check (QC-LDPC codes with one, with the intention of saving as much memory as required to implement the LDPC encoder and decoder in a memory-constrained System on a Chip (SoC. The presented method requires only a very small modification of the existing encoder and decoder, making it suitable for utilization in a Software Defined Radio (SDR platform. Besides the analysis of the effects of necessary variable-node value fixation during the Belief Propagation (BP decoding algorithm, practical standard-defined code parameters are scrutinized in order to evaluate the feasibility of the proposed LDPC setup simplification. Finally, the error performance of the modified system structure is evaluated and compared with the original system structure by means of simulation.

Fast decoding of codes from algebraic plane curves

DEFF Research Database (Denmark)

Justesen, Jørn; Larsen, Knud J.; Jensen, Helge Elbrønd

1992-01-01

Improvement to an earlier decoding algorithm for codes from algebraic geometry is presented. For codes from an arbitrary regular plane curve the authors correct up to d*/2-m2 /8+m/4-9/8 errors, where d* is the designed distance of the code and m is the degree of the curve. The complexity of finding...

Complete ML Decoding orf the (73,45) PG Code

DEFF Research Database (Denmark)

Justesen, Jørn; Høholdt, Tom; Hjaltason, Johan

2005-01-01

Our recent proof of the completeness of decoding by list bit flipping is reviewed. The proof is based on an enumeration of all cosets of low weight in terms of their minimum weight and syndrome weight. By using a geometric description of the error patterns we characterize all remaining cosets....

Low-Power Bitstream-Residual Decoder for H.264/AVC Baseline Profile Decoding

Directory of Open Access Journals (Sweden)

Xu Ke

2009-01-01

Full Text Available Abstract We present the design and VLSI implementation of a novel low-power bitstream-residual decoder for H.264/AVC baseline profile. It comprises a syntax parser, a parameter decoder, and an Inverse Quantization Inverse Transform (IQIT decoder. The syntax parser detects and decodes each incoming codeword in the bitstream under the control of a hierarchical Finite State Machine (FSM; the IQIT decoder performs inverse transform and quantization with pipelining and parallelism. Various power reduction techniques, such as data-driven based on statistic results, nonuniform partition, precomputation, guarded evaluation, hierarchical FSM decomposition, TAG method, zero-block skipping, and clock gating , are adopted and integrated throughout the bitstream-residual decoder. With innovative architecture, the proposed design is able to decode QCIF video sequences of 30 fps at a clock rate as low as 1.5 MHz. A prototype H.264/AVC baseline decoding chip utilizing the proposed decoder is fabricated in UMC 0.18  m 1P6M CMOS technology. The proposed design is measured under 1 V 1.8 V supply with 0.1 V step. It dissipates 76  W at 1 V and 253  W at 1.8 V.

Maximum likelihood convolutional decoding (MCD) performance due to system losses

Science.gov (United States)

Webster, L.

1976-01-01

A model for predicting the computational performance of a maximum likelihood convolutional decoder (MCD) operating in a noisy carrier reference environment is described. This model is used to develop a subroutine that will be utilized by the Telemetry Analysis Program to compute the MCD bit error rate. When this computational model is averaged over noisy reference phase errors using a high-rate interpolation scheme, the results are found to agree quite favorably with experimental measurements.

Performance Analysis of CRC Codes for Systematic and Nonsystematic Polar Codes with List Decoding

Directory of Open Access Journals (Sweden)

Takumi Murata

2018-01-01

Full Text Available Successive cancellation list (SCL decoding of polar codes is an effective approach that can significantly outperform the original successive cancellation (SC decoding, provided that proper cyclic redundancy-check (CRC codes are employed at the stage of candidate selection. Previous studies on CRC-assisted polar codes mostly focus on improvement of the decoding algorithms as well as their implementation, and little attention has been paid to the CRC code structure itself. For the CRC-concatenated polar codes with CRC code as their outer code, the use of longer CRC code leads to reduction of information rate, whereas the use of shorter CRC code may reduce the error detection probability, thus degrading the frame error rate (FER performance. Therefore, CRC codes of proper length should be employed in order to optimize the FER performance for a given signal-to-noise ratio (SNR per information bit. In this paper, we investigate the effect of CRC codes on the FER performance of polar codes with list decoding in terms of the CRC code length as well as its generator polynomials. Both the original nonsystematic and systematic polar codes are considered, and we also demonstrate that different behaviors of CRC codes should be observed depending on whether the inner polar code is systematic or not.

Error rate performance of narrowband multilevel CPFSK signals

Science.gov (United States)

Ekanayake, N.; Fonseka, K. J. P.

1987-04-01

The paper presents a relatively simple method for analyzing the effect of IF filtering on the performance of multilevel FM signals. Using this method, the error rate performance of narrowband FM signals is analyzed for three different detection techniques, namely limiter-discriminator detection, differential detection and coherent detection followed by differential decoding. The symbol error probabilities are computed for a Gaussian IF filter and a second-order Butterworth IF filter. It is shown that coherent detection and differential decoding yields better performance than limiter-discriminator detection and differential detection, whereas two noncoherent detectors yield approximately identical performance.

Completion time reduction in instantly decodable network coding through decoding delay control

KAUST Repository

Douik, Ahmed S.; Sorour, Sameh; Alouini, Mohamed-Slim; Al-Naffouri, Tareq Y.

2014-01-01

For several years, the completion time and the decoding delay problems in Instantly Decodable Network Coding (IDNC) were considered separately and were thought to completely act against each other. Recently, some works aimed to balance the effects of these two important IDNC metrics but none of them studied a further optimization of one by controlling the other. In this paper, we study the effect of controlling the decoding delay to reduce the completion time below its currently best known solution. We first derive the decoding-delay-dependent expressions of the users' and their overall completion times. Although using such expressions to find the optimal overall completion time is NP-hard, we use a heuristic that minimizes the probability of increasing the maximum of these decoding-delay-dependent completion time expressions after each transmission through a layered control of their decoding delays. Simulation results show that this new algorithm achieves both a lower mean completion time and mean decoding delay compared to the best known heuristic for completion time reduction. The gap in performance becomes significant for harsh erasure scenarios.

Completion time reduction in instantly decodable network coding through decoding delay control

KAUST Repository

Douik, Ahmed S.

2014-12-01

For several years, the completion time and the decoding delay problems in Instantly Decodable Network Coding (IDNC) were considered separately and were thought to completely act against each other. Recently, some works aimed to balance the effects of these two important IDNC metrics but none of them studied a further optimization of one by controlling the other. In this paper, we study the effect of controlling the decoding delay to reduce the completion time below its currently best known solution. We first derive the decoding-delay-dependent expressions of the users\\' and their overall completion times. Although using such expressions to find the optimal overall completion time is NP-hard, we use a heuristic that minimizes the probability of increasing the maximum of these decoding-delay-dependent completion time expressions after each transmission through a layered control of their decoding delays. Simulation results show that this new algorithm achieves both a lower mean completion time and mean decoding delay compared to the best known heuristic for completion time reduction. The gap in performance becomes significant for harsh erasure scenarios.

Convolutional Encoder and Viterbi Decoder Using SOPC For Variable Constraint Length

DEFF Research Database (Denmark)

Kulkarni, Anuradha; Dnyaneshwar, Mantri; Prasad, Neeli R.

2013-01-01

Convolution encoder and Viterbi decoder are the basic and important blocks in any Code Division Multiple Accesses (CDMA). They are widely used in communication system due to their error correcting capability But the performance degrades with variable constraint length. In this context to have...... detailed analysis, this paper deals with the implementation of convolution encoder and Viterbi decoder using system on programming chip (SOPC). It uses variable constraint length of 7, 8 and 9 bits for 1/2 and 1/3 code rates. By analyzing the Viterbi algorithm it is seen that our algorithm has a better...

VLSI Architecture for Configurable and Low-Complexity Design of Hard-Decision Viterbi Decoding Algorithm

Directory of Open Access Journals (Sweden)

Rachmad Vidya Wicaksana Putra

2016-06-01

Full Text Available Convolutional encoding and data decoding are fundamental processes in convolutional error correction. One of the most popular error correction methods in decoding is the Viterbi algorithm. It is extensively implemented in many digital communication applications. Its VLSI design challenges are about area, speed, power, complexity and configurability. In this research, we specifically propose a VLSI architecture for a configurable and low-complexity design of a hard-decision Viterbi decoding algorithm. The configurable and low-complexity design is achieved by designing a generic VLSI architecture, optimizing each processing element (PE at the logical operation level and designing a conditional adapter. The proposed design can be configured for any predefined number of trace-backs, only by changing the trace-back parameter value. Its computational process only needs N + 2 clock cycles latency, with N is the number of trace-backs. Its configurability function has been proven for N = 8, N = 16, N = 32 and N = 64. Furthermore, the proposed design was synthesized and evaluated in Xilinx and Altera FPGA target boards for area consumption and speed performance.

Modeling coherent errors in quantum error correction

Science.gov (United States)

Greenbaum, Daniel; Dutton, Zachary

2018-01-01

Analysis of quantum error correcting codes is typically done using a stochastic, Pauli channel error model for describing the noise on physical qubits. However, it was recently found that coherent errors (systematic rotations) on physical data qubits result in both physical and logical error rates that differ significantly from those predicted by a Pauli model. Here we examine the accuracy of the Pauli approximation for noise containing coherent errors (characterized by a rotation angle ɛ) under the repetition code. We derive an analytic expression for the logical error channel as a function of arbitrary code distance d and concatenation level n, in the small error limit. We find that coherent physical errors result in logical errors that are partially coherent and therefore non-Pauli. However, the coherent part of the logical error is negligible at fewer than {ε }-({dn-1)} error correction cycles when the decoder is optimized for independent Pauli errors, thus providing a regime of validity for the Pauli approximation. Above this number of correction cycles, the persistent coherent logical error will cause logical failure more quickly than the Pauli model would predict, and this may need to be combated with coherent suppression methods at the physical level or larger codes.

Decoding Xing-Ling codes

DEFF Research Database (Denmark)

Nielsen, Rasmus Refslund

2002-01-01

This paper describes an efficient decoding method for a recent construction of good linear codes as well as an extension to the construction. Furthermore, asymptotic properties and list decoding of the codes are discussed.......This paper describes an efficient decoding method for a recent construction of good linear codes as well as an extension to the construction. Furthermore, asymptotic properties and list decoding of the codes are discussed....

Identification and role of functionally important motifs in the 970 loop of Escherichia coli 16S ribosomal RNA.

Science.gov (United States)

Saraiya, Ashesh A; Lamichhane, Tek N; Chow, Christine S; SantaLucia, John; Cunningham, Philip R

2008-02-22

The 970 loop (helix 31) of Escherichia coli 16S ribosomal RNA contains two modified nucleotides, m(2)G966 and m(5)C967. Positions A964, A969, and C970 are conserved among the Bacteria, Archaea, and Eukarya. The nucleotides present at positions 965, 966, 967, 968, and 971, however, are only conserved and unique within each domain. All organisms contain a modified nucleoside at position 966, but the type of the modification is domain specific. Biochemical and structure studies have placed this loop near the P site and have shown it to be involved in the decoding process and in binding the antibiotic tetracycline. To identify the functional components of this ribosomal RNA hairpin, the eight nucleotides of the 970 loop of helix 31 were subjected to saturation mutagenesis and 107 unique functional mutants were isolated and analyzed. Nonrandom nucleotide distributions were observed at each mutated position among the functional isolates. Nucleotide identity at positions 966 and 969 significantly affects ribosome function. Ribosomes with single mutations of m(2)G966 or m(5)C967 produce more protein in vivo than do wild-type ribosomes. Overexpression of initiation factor 3 specifically restored wild-type levels of protein synthesis to the 966 and 967 mutants, suggesting that modification of these residues is important for initiation factor 3 binding and for the proper initiation of protein synthesis.

Minimum decoding trellis length and truncation depth of wrap-around Viterbi algorithm for TBCC in mobile WiMAX

Directory of Open Access Journals (Sweden)

Liu Yu-Sun

2011-01-01

Full Text Available Abstract The performance of the wrap-around Viterbi decoding algorithm with finite truncation depth and fixed decoding trellis length is investigated for tail-biting convolutional codes in the mobile WiMAX standard. Upper bounds on the error probabilities induced by finite truncation depth and the uncertainty of the initial state are derived for the AWGN channel. The truncation depth and the decoding trellis length that yield negligible performance loss are obtained for all transmission rates over the Rayleigh channel using computer simulations. The results show that the circular decoding algorithm with an appropriately chosen truncation depth and a decoding trellis just a fraction longer than the original received code words can achieve almost the same performance as the optimal maximum likelihood decoding algorithm in mobile WiMAX. A rule of thumb for the values of the truncation depth and the trellis tail length is also proposed.

Rank error-correcting pairs

DEFF Research Database (Denmark)

Martinez Peñas, Umberto; Pellikaan, Ruud

2017-01-01

Error-correcting pairs were introduced as a general method of decoding linear codes with respect to the Hamming metric using coordinatewise products of vectors, and are used for many well-known families of codes. In this paper, we define new types of vector products, extending the coordinatewise ...

Oxidative damage of 18S and 5S ribosomal RNA in digestive gland of mussels exposed to trace metals.

Science.gov (United States)

Kournoutou, Georgia G; Giannopoulou, Panagiota C; Sazakli, Eleni; Leotsinidis, Michel; Kalpaxis, Dimitrios L

2017-11-01

Numerous studies have shown the ability of trace metals to accumulate in marine organisms and cause oxidative stress that leads to perturbations in many important intracellular processes, including protein synthesis. This study is mainly focused on the exploration of structural changes, like base modifications, scissions, and conformational changes, caused in 18S and 5S ribosomal RNA (rRNA) isolated from the mussel Mytilus galloprovincialis exposed to 40μg/L Cu, 30μg/L Hg, or 100μg/L Cd, for 5 or 15days. 18S rRNA and 5S rRNA are components of the small and large ribosomal subunit, respectively, found in complex with ribosomal proteins, translation factors and other auxiliary components (metal ions, toxins etc). 18S rRNA plays crucial roles in all stages of protein synthesis, while 5S rRNA serves as a master signal transducer between several functional regions of 28S rRNA. Therefore, structural changes in these ribosomal constituents could affect the basic functions of ribosomes and hence the normal metabolism of cells. Especially, 18S rRNA along with ribosomal proteins forms the decoding centre that ensures the correct codon-anticodon pairing. As exemplified by ELISA, primer extension analysis and DMS footprinting analysis, each metal caused oxidative damage to rRNA, depending on the nature of metal ion and the duration of exposure. Interestingly, exposure of mussels to Cu or Hg caused structural alterations in 5S rRNA, localized in paired regions and within loops A, B, C, and E, leading to a continuous progressive loss of the 5S RNA structural integrity. In contrast, structural impairments of 5S rRNA in mussels exposed to Cd were accumulating for the initial 5days, and then progressively decreased to almost the normal level by day 15, probably due to the parallel elevation of metallothionein content that depletes the pools of free Cd. Regions of interest in 18S rRNA, such as the decoding centre, sites implicated in the binding of tRNAs (A- and P-sites) or

Toric Varieties and Codes, Error-correcting Codes, Quantum Codes, Secret Sharing and Decoding

DEFF Research Database (Denmark)

Hansen, Johan Peder

We present toric varieties and associated toric codes and their decoding. Toric codes are applied to construct Linear Secret Sharing Schemes (LSSS) with strong multiplication by the Massey construction. Asymmetric Quantum Codes are obtained from toric codes by the A.R. Calderbank P.W. Shor and A.......M. Steane construction of stabilizer codes (CSS) from linear codes containing their dual codes....

The fast decoding of Reed-Solomon codes using high-radix fermat theoretic transforms

Science.gov (United States)

Liu, K. Y.; Reed, I. S.; Truong, T. K.

1976-01-01

Fourier-like transforms over GF(F sub n), where F sub n = 2(2n) + 1 is a Fermat prime, are applied in decoding Reed-Solomon codes. It is shown that such transforms can be computed using high-radix fast Fourier transform (FFT) algorithms requiring considerably fewer multiplications than the more usual radix 2 FFT algorithm. A special 256-symbol, 16-symbol-error-correcting, Reed-Solomon (RS) code for space communication-link applications can be encoded and decoded using this high-radix FFT algorithm over GF(F sub 3).

Decoding Facial Expressions: A New Test with Decoding Norms.

Science.gov (United States)

Leathers, Dale G.; Emigh, Ted H.

1980-01-01

Describes the development and testing of a new facial meaning sensitivity test designed to determine how specialized are the meanings that can be decoded from facial expressions. Demonstrates the use of the test to measure a receiver's current level of skill in decoding facial expressions. (JMF)

Error correcting coding for OTN

DEFF Research Database (Denmark)

Justesen, Jørn; Larsen, Knud J.; Pedersen, Lars A.

2010-01-01

Forward error correction codes for 100 Gb/s optical transmission are currently receiving much attention from transport network operators and technology providers. We discuss the performance of hard decision decoding using product type codes that cover a single OTN frame or a small number...... of such frames. In particular we argue that a three-error correcting BCH is the best choice for the component code in such systems....

Forced Sequence Sequential Decoding

DEFF Research Database (Denmark)

Jensen, Ole Riis; Paaske, Erik

1998-01-01

We describe a new concatenated decoding scheme based on iterations between an inner sequentially decoded convolutional code of rate R=1/4 and memory M=23, and block interleaved outer Reed-Solomon (RS) codes with nonuniform profile. With this scheme decoding with good performance is possible as low...... as Eb/N0=0.6 dB, which is about 1.25 dB below the signal-to-noise ratio (SNR) that marks the cutoff rate for the full system. Accounting for about 0.45 dB due to the outer codes, sequential decoding takes place at about 1.7 dB below the SNR cutoff rate for the convolutional code. This is possible since...... the iteration process provides the sequential decoders with side information that allows a smaller average load and minimizes the probability of computational overflow. Analytical results for the probability that the first RS word is decoded after C computations are presented. These results are supported...

Concatenated coding systems employing a unit-memory convolutional code and a byte-oriented decoding algorithm

Science.gov (United States)

Lee, L.-N.

1977-01-01

Concatenated coding systems utilizing a convolutional code as the inner code and a Reed-Solomon code as the outer code are considered. In order to obtain very reliable communications over a very noisy channel with relatively modest coding complexity, it is proposed to concatenate a byte-oriented unit-memory convolutional code with an RS outer code whose symbol size is one byte. It is further proposed to utilize a real-time minimal-byte-error probability decoding algorithm, together with feedback from the outer decoder, in the decoder for the inner convolutional code. The performance of the proposed concatenated coding system is studied, and the improvement over conventional concatenated systems due to each additional feature is isolated.

Restoring the Generalizability of SVM Based Decoding in High Dimensional Neuroimage Data

DEFF Research Database (Denmark)

Abrahamsen, Trine Julie; Hansen, Lars Kai

2011-01-01

Variance inflation is caused by a mismatch between linear projections of test and training data when projections are estimated on training sets smaller than the dimensionality of the feature space. We demonstrate that variance inflation can lead to an increased neuroimage decoding error rate...

Product code optimization for determinate state LDPC decoding in robust image transmission.

Science.gov (United States)

Thomos, Nikolaos; Boulgouris, Nikolaos V; Strintzis, Michael G

2006-08-01

We propose a novel scheme for error-resilient image transmission. The proposed scheme employs a product coder consisting of low-density parity check (LDPC) codes and Reed-Solomon codes in order to deal effectively with bit errors. The efficiency of the proposed scheme is based on the exploitation of determinate symbols in Tanner graph decoding of LDPC codes and a novel product code optimization technique based on error estimation. Experimental evaluation demonstrates the superiority of the proposed system in comparison to recent state-of-the-art techniques for image transmission.

Jointly Decoded Raptor Codes: Analysis and Design for the BIAWGN Channel

Directory of Open Access Journals (Sweden)

Venkiah Auguste

2009-01-01

Full Text Available Abstract We are interested in the analysis and optimization of Raptor codes under a joint decoding framework, that is, when the precode and the fountain code exchange soft information iteratively. We develop an analytical asymptotic convergence analysis of the joint decoder, derive an optimization method for the design of efficient output degree distributions, and show that the new optimized distributions outperform the existing ones, both at long and moderate lengths. We also show that jointly decoded Raptor codes are robust to channel variation: they perform reasonably well over a wide range of channel capacities. This robustness property was already known for the erasure channel but not for the Gaussian channel. Finally, we discuss some finite length code design issues. Contrary to what is commonly believed, we show by simulations that using a relatively low rate for the precode , we can improve greatly the error floor performance of the Raptor code.

Sudan-decoding generalized geometric Goppa codes

DEFF Research Database (Denmark)

Heydtmann, Agnes Eileen

2003-01-01

Generalized geometric Goppa codes are vector spaces of n-tuples with entries from different extension fields of a ground field. They are derived from evaluating functions similar to conventional geometric Goppa codes, but allowing evaluation in places of arbitrary degree. A decoding scheme...... for these codes based on Sudan's improved algorithm is presented and its error-correcting capacity is analyzed. For the implementation of the algorithm it is necessary that the so-called increasing zero bases of certain spaces of functions are available. A method to obtain such bases is developed....

Augmenting intracortical brain-machine interface with neurally driven error detectors

Science.gov (United States)

Even-Chen, Nir; Stavisky, Sergey D.; Kao, Jonathan C.; Ryu, Stephen I.; Shenoy, Krishna V.

2017-12-01

Objective. Making mistakes is inevitable, but identifying them allows us to correct or adapt our behavior to improve future performance. Current brain-machine interfaces (BMIs) make errors that need to be explicitly corrected by the user, thereby consuming time and thus hindering performance. We hypothesized that neural correlates of the user perceiving the mistake could be used by the BMI to automatically correct errors. However, it was unknown whether intracortical outcome error signals were present in the premotor and primary motor cortices, brain regions successfully used for intracortical BMIs. Approach. We report here for the first time a putative outcome error signal in spiking activity within these cortices when rhesus macaques performed an intracortical BMI computer cursor task. Main results. We decoded BMI trial outcomes shortly after and even before a trial ended with 96% and 84% accuracy, respectively. This led us to develop and implement in real-time a first-of-its-kind intracortical BMI error ‘detect-and-act’ system that attempts to automatically ‘undo’ or ‘prevent’ mistakes. The detect-and-act system works independently and in parallel to a kinematic BMI decoder. In a challenging task that resulted in substantial errors, this approach improved the performance of a BMI employing two variants of the ubiquitous Kalman velocity filter, including a state-of-the-art decoder (ReFIT-KF). Significance. Detecting errors in real-time from the same brain regions that are commonly used to control BMIs should improve the clinical viability of BMIs aimed at restoring motor function to people with paralysis.

[Efficacy of decoding training for children with difficulty reading hiragana].

Science.gov (United States)

Uchiyama, Hitoshi; Tanaka, Daisuke; Seki, Ayumi; Wakamiya, Eiji; Hirasawa, Noriko; Iketani, Naotake; Kato, Ken; Koeda, Tatsuya

2013-05-01

The present study aimed to clarify the efficacy of decoding training focusing on the correspondence between written symbols and their readings for children with difficulty reading hiragana (Japanese syllabary). Thirty-five children with difficulty reading hiragana were selected from among 367 first-grade elementary school students using a reading aloud test and were then divided into intervention (n=15) and control (n=20) groups. The intervention comprised 5 minutes of decoding training each day for a period of 3 weeks using an original program on a personal computer. Reading time and number of reading errors in the reading aloud test were compared between the groups. The intervention group showed a significant shortening of reading time (F(1,33)=5.40, phiragana.

High-dimensional structured light coding/decoding for free-space optical communications free of obstructions.

Science.gov (United States)

Du, Jing; Wang, Jian

2015-11-01

Bessel beams carrying orbital angular momentum (OAM) with helical phase fronts exp(ilφ)(l=0;±1;±2;…), where φ is the azimuthal angle and l corresponds to the topological number, are orthogonal with each other. This feature of Bessel beams provides a new dimension to code/decode data information on the OAM state of light, and the theoretical infinity of topological number enables possible high-dimensional structured light coding/decoding for free-space optical communications. Moreover, Bessel beams are nondiffracting beams having the ability to recover by themselves in the face of obstructions, which is important for free-space optical communications relying on line-of-sight operation. By utilizing the OAM and nondiffracting characteristics of Bessel beams, we experimentally demonstrate 12 m distance obstruction-free optical m-ary coding/decoding using visible Bessel beams in a free-space optical communication system. We also study the bit error rate (BER) performance of hexadecimal and 32-ary coding/decoding based on Bessel beams with different topological numbers. After receiving 500 symbols at the receiver side, a zero BER of hexadecimal coding/decoding is observed when the obstruction is placed along the propagation path of light.

Forced Sequence Sequential Decoding

DEFF Research Database (Denmark)

Jensen, Ole Riis

In this thesis we describe a new concatenated decoding scheme based on iterations between an inner sequentially decoded convolutional code of rate R=1/4 and memory M=23, and block interleaved outer Reed-Solomon codes with non-uniform profile. With this scheme decoding with good performance...... is possible as low as Eb/No=0.6 dB, which is about 1.7 dB below the signal-to-noise ratio that marks the cut-off rate for the convolutional code. This is possible since the iteration process provides the sequential decoders with side information that allows a smaller average load and minimizes the probability...... of computational overflow. Analytical results for the probability that the first Reed-Solomon word is decoded after C computations are presented. This is supported by simulation results that are also extended to other parameters....

Iterative optimization of quantum error correcting codes

International Nuclear Information System (INIS)

Reimpell, M.; Werner, R.F.

2005-01-01

We introduce a convergent iterative algorithm for finding the optimal coding and decoding operations for an arbitrary noisy quantum channel. This algorithm does not require any error syndrome to be corrected completely, and hence also finds codes outside the usual Knill-Laflamme definition of error correcting codes. The iteration is shown to improve the figure of merit 'channel fidelity' in every step

Implementation of Layered Decoding Architecture for LDPC Code using Layered Min-Sum Algorithm

OpenAIRE

Sandeep Kakde; Atish Khobragade; Shrikant Ambatkar; Pranay Nandanwar

2017-01-01

For binary field and long code lengths, Low Density Parity Check (LDPC) code approaches Shannon limit performance. LDPC codes provide remarkable error correction performance and therefore enlarge the design space for communication systems.In this paper, we have compare different digital modulation techniques and found that BPSK modulation technique is better than other modulation techniques in terms of BER. It also gives error performance of LDPC decoder over AWGN channel using Min-Sum algori...

Performance analysis of linear codes under maximum-likelihood decoding: a tutorial

National Research Council Canada - National Science Library

Sason, Igal; Shamai, Shlomo

2006-01-01

..., upper and lower bounds on the error probability of linear codes under ML decoding are surveyed and applied to codes and ensembles of codes on graphs. For upper bounds, we discuss various bounds where focus is put on Gallager bounding techniques and their relation to a variety of other reported bounds. Within the class of lower bounds, we ad...

Analysis of error-correction constraints in an optical disk

Science.gov (United States)

Roberts, Jonathan D.; Ryley, Alan; Jones, David M.; Burke, David

1996-07-01

The compact disk read-only memory (CD-ROM) is a mature storage medium with complex error control. It comprises four levels of Reed Solomon codes allied to a sequence of sophisticated interleaving strategies and 8:14 modulation coding. New storage media are being developed and introduced that place still further demands on signal processing for error correction. It is therefore appropriate to explore thoroughly the limit of existing strategies to assess future requirements. We describe a simulation of all stages of the CD-ROM coding, modulation, and decoding. The results of decoding the burst error of a prescribed number of modulation bits are discussed in detail. Measures of residual uncorrected error within a sector are displayed by C1, C2, P, and Q error counts and by the status of the final cyclic redundancy check (CRC). Where each data sector is encoded separately, it is shown that error-correction performance against burst errors depends critically on the position of the burst within a sector. The C1 error measures the burst length, whereas C2 errors reflect the burst position. The performance of Reed Solomon product codes is shown by the P and Q statistics. It is shown that synchronization loss is critical near the limits of error correction. An example is given of miscorrection that is identified by the CRC check.

Codes on the Klein quartic, ideals, and decoding

DEFF Research Database (Denmark)

Hansen, Johan P.

1987-01-01

descriptions as left ideals in the group-algebra GF(2^{3})[G]. This description allows for easy decoding. For instance, in the case of the single error correcting code of length21and dimension16with minimal distance3. decoding is obtained by multiplication with an idempotent in the group algebra.......A sequence of codes with particular symmetries and with large rates compared to their minimal distances is constructed over the field GF(2^{3}). In the sequence there is, for instance, a code of length 21 and dimension10with minimal distance9, and a code of length21and dimension16with minimal...... distance3. The codes are constructed from algebraic geometry using the dictionary between coding theory and algebraic curves over finite fields established by Goppa. The curve used in the present work is the Klein quartic. This curve has the maximal number of rational points over GF(2^{3})allowed by Serre...

List Decoding of Algebraic Codes

DEFF Research Database (Denmark)

Nielsen, Johan Sebastian Rosenkilde

We investigate three paradigms for polynomial-time decoding of Reed–Solomon codes beyond half the minimum distance: the Guruswami–Sudan algorithm, Power decoding and the Wu algorithm. The main results concern shaping the computational core of all three methods to a problem solvable by module...... Hermitian codes using Guruswami–Sudan or Power decoding faster than previously known, and we show how to Wu list decode binary Goppa codes....... to solve such using module minimisation, or using our new Demand–Driven algorithm which is also based on module minimisation. The decoding paradigms are all derived and analysed in a self-contained manner, often in new ways or examined in greater depth than previously. Among a number of new results, we...

Decoding Delay Controlled Completion Time Reduction in Instantly Decodable Network Coding

KAUST Repository

Douik, Ahmed

2016-06-27

For several years, the completion time and the decoding delay problems in Instantly Decodable Network Coding (IDNC) were considered separately and were thought to act completely against each other. Recently, some works aimed to balance the effects of these two important IDNC metrics but none of them studied a further optimization of one by controlling the other. This paper investigates the effect of controlling the decoding delay to reduce the completion time below its currently best-known solution in both perfect and imperfect feedback with persistent erasure channels. To solve the problem, the decodingdelay- dependent expressions of the users’ and overall completion times are derived in the complete feedback scenario. Although using such expressions to find the optimal overall completion time is NP-hard, the paper proposes two novel heuristics that minimizes the probability of increasing the maximum of these decoding-delay-dependent completion time expressions after each transmission through a layered control of their decoding delays. Afterward, the paper extends the study to the imperfect feedback scenario in which uncertainties at the sender affects its ability to anticipate accurately the decoding delay increase at each user. The paper formulates the problem in such environment and derives the expression of the minimum increase in the completion time. Simulation results show the performance of the proposed solutions and suggest that both heuristics achieves a lower mean completion time as compared to the best-known heuristics for the completion time reduction in perfect and imperfect feedback. The gap in performance becomes more significant as the erasure of the channel increases.

Decoding Delay Controlled Completion Time Reduction in Instantly Decodable Network Coding

KAUST Repository

Douik, Ahmed S.; Sorour, Sameh; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim

2016-01-01

For several years, the completion time and the decoding delay problems in Instantly Decodable Network Coding (IDNC) were considered separately and were thought to act completely against each other. Recently, some works aimed to balance the effects of these two important IDNC metrics but none of them studied a further optimization of one by controlling the other. This paper investigates the effect of controlling the decoding delay to reduce the completion time below its currently best-known solution in both perfect and imperfect feedback with persistent erasure channels. To solve the problem, the decodingdelay- dependent expressions of the users’ and overall completion times are derived in the complete feedback scenario. Although using such expressions to find the optimal overall completion time is NP-hard, the paper proposes two novel heuristics that minimizes the probability of increasing the maximum of these decoding-delay-dependent completion time expressions after each transmission through a layered control of their decoding delays. Afterward, the paper extends the study to the imperfect feedback scenario in which uncertainties at the sender affects its ability to anticipate accurately the decoding delay increase at each user. The paper formulates the problem in such environment and derives the expression of the minimum increase in the completion time. Simulation results show the performance of the proposed solutions and suggest that both heuristics achieves a lower mean completion time as compared to the best-known heuristics for the completion time reduction in perfect and imperfect feedback. The gap in performance becomes more significant as the erasure of the channel increases.

Can Emotional and Behavioral Dysregulation in Youth Be Decoded from Functional Neuroimaging?

Directory of Open Access Journals (Sweden)

Liana C L Portugal

Full Text Available High comorbidity among pediatric disorders characterized by behavioral and emotional dysregulation poses problems for diagnosis and treatment, and suggests that these disorders may be better conceptualized as dimensions of abnormal behaviors. Furthermore, identifying neuroimaging biomarkers related to dimensional measures of behavior may provide targets to guide individualized treatment. We aimed to use functional neuroimaging and pattern regression techniques to determine whether patterns of brain activity could accurately decode individual-level severity on a dimensional scale measuring behavioural and emotional dysregulation at two different time points.A sample of fifty-seven youth (mean age: 14.5 years; 32 males was selected from a multi-site study of youth with parent-reported behavioral and emotional dysregulation. Participants performed a block-design reward paradigm during functional Magnetic Resonance Imaging (fMRI. Pattern regression analyses consisted of Relevance Vector Regression (RVR and two cross-validation strategies implemented in the Pattern Recognition for Neuroimaging toolbox (PRoNTo. Medication was treated as a binary confounding variable. Decoded and actual clinical scores were compared using Pearson's correlation coefficient (r and mean squared error (MSE to evaluate the models. Permutation test was applied to estimate significance levels.Relevance Vector Regression identified patterns of neural activity associated with symptoms of behavioral and emotional dysregulation at the initial study screen and close to the fMRI scanning session. The correlation and the mean squared error between actual and decoded symptoms were significant at the initial study screen and close to the fMRI scanning session. However, after controlling for potential medication effects, results remained significant only for decoding symptoms at the initial study screen. Neural regions with the highest contribution to the pattern regression model

Decoding suprathreshold stochastic resonance with optimal weights

International Nuclear Information System (INIS)

Xu, Liyan; Vladusich, Tony; Duan, Fabing; Gunn, Lachlan J.; Abbott, Derek; McDonnell, Mark D.

2015-01-01

We investigate an array of stochastic quantizers for converting an analog input signal into a discrete output in the context of suprathreshold stochastic resonance. A new optimal weighted decoding is considered for different threshold level distributions. We show that for particular noise levels and choices of the threshold levels optimally weighting the quantizer responses provides a reduced mean square error in comparison with the original unweighted array. However, there are also many parameter regions where the original array provides near optimal performance, and when this occurs, it offers a much simpler approach than optimally weighting each quantizer's response. - Highlights: • A weighted summing array of independently noisy binary comparators is investigated. • We present an optimal linearly weighted decoding scheme for combining the comparator responses. • We solve for the optimal weights by applying least squares regression to simulated data. • We find that the MSE distortion of weighting before summation is superior to unweighted summation of comparator responses. • For some parameter regions, the decrease in MSE distortion due to weighting is negligible

Improved decoding for a concatenated coding system

DEFF Research Database (Denmark)

Paaske, Erik

1990-01-01

The concatenated coding system recommended by CCSDS (Consultative Committee for Space Data Systems) uses an outer (255,233) Reed-Solomon (RS) code based on 8-b symbols, followed by the block interleaver and an inner rate 1/2 convolutional code with memory 6. Viterbi decoding is assumed. Two new...... decoding procedures based on repeated decoding trials and exchange of information between the two decoders and the deinterleaver are proposed. In the first one, where the improvement is 0.3-0.4 dB, only the RS decoder performs repeated trials. In the second one, where the improvement is 0.5-0.6 dB, both...... decoders perform repeated decoding trials and decoding information is exchanged between them...

Decoding Different Patterns in Various Grey Tones Incorporated in the QR Code

Directory of Open Access Journals (Sweden)

Filip Cvitić

2014-07-01

Full Text Available Using colors in bar codes causes errors that may adversely affect their readability (Tan etal. 2010, given that the contrast between data and background modules is reduced. Due to the unreliability of using color bar codes, most designers still keep to the limitations placed by Pira International (Smithers Pira in 2002 (Williams, 2004. Since the contrast between data modules and background modules is the most important aspect in the process of reliable bar code decoding, this paper explores the dependence of reliable decoding of QR codes incorporated with combinations of grey tones on the technical characteristics of the cameras on smartphones that were marketed in the period between 2008 and 2012.

Progressive and Error-Resilient Transmission Strategies for VLC Encoded Signals over Noisy Channels

Directory of Open Access Journals (Sweden)

Guillemot Christine

2006-01-01

Full Text Available This paper addresses the issue of robust and progressive transmission of signals (e.g., images, video encoded with variable length codes (VLCs over error-prone channels. This paper first describes bitstream construction methods offering good properties in terms of error resilience and progressivity. In contrast with related algorithms described in the literature, all proposed methods have a linear complexity as the sequence length increases. The applicability of soft-input soft-output (SISO and turbo decoding principles to resulting bitstream structures is investigated. In addition to error resilience, the amenability of the bitstream construction methods to progressive decoding is considered. The problem of code design for achieving good performance in terms of error resilience and progressive decoding with these transmission strategies is then addressed. The VLC code has to be such that the symbol energy is mainly concentrated on the first bits of the symbol representation (i.e., on the first transitions of the corresponding codetree. Simulation results reveal high performance in terms of symbol error rate (SER and mean-square reconstruction error (MSE. These error-resilience and progressivity properties are obtained without any penalty in compression efficiency. Codes with such properties are of strong interest for the binarization of -ary sources in state-of-the-art image, and video coding systems making use of, for example, the EBCOT or CABAC algorithms. A prior statistical analysis of the signal allows the construction of the appropriate binarization code.

Constrained motion estimation-based error resilient coding for HEVC

Science.gov (United States)

Guo, Weihan; Zhang, Yongfei; Li, Bo

2018-04-01

Unreliable communication channels might lead to packet losses and bit errors in the videos transmitted through it, which will cause severe video quality degradation. This is even worse for HEVC since more advanced and powerful motion estimation methods are introduced to further remove the inter-frame dependency and thus improve the coding efficiency. Once a Motion Vector (MV) is lost or corrupted, it will cause distortion in the decoded frame. More importantly, due to motion compensation, the error will propagate along the motion prediction path, accumulate over time, and significantly degrade the overall video presentation quality. To address this problem, we study the problem of encoder-sider error resilient coding for HEVC and propose a constrained motion estimation scheme to mitigate the problem of error propagation to subsequent frames. The approach is achieved by cutting off MV dependencies and limiting the block regions which are predicted by temporal motion vector. The experimental results show that the proposed method can effectively suppress the error propagation caused by bit errors of motion vector and can improve the robustness of the stream in the bit error channels. When the bit error probability is 10-5, an increase of the decoded video quality (PSNR) by up to1.310dB and on average 0.762 dB can be achieved, compared to the reference HEVC.

Ribosomal protein methyltransferases in the yeast Saccharomyces cerevisiae: Roles in ribosome biogenesis and translation.

Science.gov (United States)

Al-Hadid, Qais; White, Jonelle; Clarke, Steven

2016-02-12

A significant percentage of the methyltransferasome in Saccharomyces cerevisiae and higher eukaryotes is devoted to methylation of the translational machinery. Methylation of the RNA components of the translational machinery has been studied extensively and is important for structure stability, ribosome biogenesis, and translational fidelity. However, the functional effects of ribosomal protein methylation by their cognate methyltransferases are still largely unknown. Previous work has shown that the ribosomal protein Rpl3 methyltransferase, histidine protein methyltransferase 1 (Hpm1), is important for ribosome biogenesis and translation elongation fidelity. In this study, yeast strains deficient in each of the ten ribosomal protein methyltransferases in S. cerevisiae were examined for potential defects in ribosome biogenesis and translation. Like Hpm1-deficient cells, loss of four of the nine other ribosomal protein methyltransferases resulted in defects in ribosomal subunit synthesis. All of the mutant strains exhibited resistance to the ribosome inhibitors anisomycin and/or cycloheximide in plate assays, but not in liquid culture. Translational fidelity assays measuring stop codon readthrough, amino acid misincorporation, and programmed -1 ribosomal frameshifting, revealed that eight of the ten enzymes are important for translation elongation fidelity and the remaining two are necessary for translation termination efficiency. Altogether, these results demonstrate that ribosomal protein methyltransferases in S. cerevisiae play important roles in ribosome biogenesis and translation. Copyright © 2016 Elsevier Inc. All rights reserved.

Population coding and decoding in a neural field: a computational study.

Science.gov (United States)

Wu, Si; Amari, Shun-Ichi; Nakahara, Hiroyuki

2002-05-01

This study uses a neural field model to investigate computational aspects of population coding and decoding when the stimulus is a single variable. A general prototype model for the encoding process is proposed, in which neural responses are correlated, with strength specified by a gaussian function of their difference in preferred stimuli. Based on the model, we study the effect of correlation on the Fisher information, compare the performances of three decoding methods that differ in the amount of encoding information being used, and investigate the implementation of the three methods by using a recurrent network. This study not only rediscovers main results in existing literatures in a unified way, but also reveals important new features, especially when the neural correlation is strong. As the neural correlation of firing becomes larger, the Fisher information decreases drastically. We confirm that as the width of correlation increases, the Fisher information saturates and no longer increases in proportion to the number of neurons. However, we prove that as the width increases further--wider than (sqrt)2 times the effective width of the turning function--the Fisher information increases again, and it increases without limit in proportion to the number of neurons. Furthermore, we clarify the asymptotic efficiency of the maximum likelihood inference (MLI) type of decoding methods for correlated neural signals. It shows that when the correlation covers a nonlocal range of population (excepting the uniform correlation and when the noise is extremely small), the MLI type of method, whose decoding error satisfies the Cauchy-type distribution, is not asymptotically efficient. This implies that the variance is no longer adequate to measure decoding accuracy.

Neuron-Like Networks Between Ribosomal Proteins Within the Ribosome

Science.gov (United States)

Poirot, Olivier; Timsit, Youri

2016-05-01

From brain to the World Wide Web, information-processing networks share common scale invariant properties. Here, we reveal the existence of neural-like networks at a molecular scale within the ribosome. We show that with their extensions, ribosomal proteins form complex assortative interaction networks through which they communicate through tiny interfaces. The analysis of the crystal structures of 50S eubacterial particles reveals that most of these interfaces involve key phylogenetically conserved residues. The systematic observation of interactions between basic and aromatic amino acids at the interfaces and along the extension provides new structural insights that may contribute to decipher the molecular mechanisms of signal transmission within or between the ribosomal proteins. Similar to neurons interacting through “molecular synapses”, ribosomal proteins form a network that suggest an analogy with a simple molecular brain in which the “sensory-proteins” innervate the functional ribosomal sites, while the “inter-proteins” interconnect them into circuits suitable to process the information flow that circulates during protein synthesis. It is likely that these circuits have evolved to coordinate both the complex macromolecular motions and the binding of the multiple factors during translation. This opens new perspectives on nanoscale information transfer and processing.

Cortical Decoding of Individual Finger and Wrist Kinematics for an Upper-Limb Neuroprosthesis

Science.gov (United States)

Aggarwal, Vikram; Tenore, Francesco; Acharya, Soumyadipta; Schieber, Marc H.; Thakor, Nitish V.

2010-01-01

Previous research has shown that neuronal activity can be used to continuously decode the kinematics of gross movements involving arm and hand trajectory. However, decoding the kinematics of fine motor movements, such as the manipulation of individual fingers, has not been demonstrated. In this study, single unit activities were recorded from task-related neurons in M1 of two trained rhesus monkey as they performed individuated movements of the fingers and wrist. The primates’ hand was placed in a manipulandum, and strain gauges at the tips of each finger were used to track the digit’s position. Both linear and non-linear filters were designed to simultaneously predict kinematics of each digit and the wrist, and their performance compared using mean squared error and correlation coefficients. All models had high decoding accuracy, but the feedforward ANN (R=0.76–0.86, MSE=0.04–0.05) and Kalman filter (R=0.68–0.86, MSE=0.04–0.07) performed better than a simple linear regression filter (0.58–0.81, 0.05–0.07). These results suggest that individual finger and wrist kinematics can be decoded with high accuracy, and be used to control a multi-fingered prosthetic hand in real-time. PMID:19964645

Toric Codes, Multiplicative Structure and Decoding

DEFF Research Database (Denmark)

Hansen, Johan Peder

2017-01-01

Long linear codes constructed from toric varieties over finite fields, their multiplicative structure and decoding. The main theme is the inherent multiplicative structure on toric codes. The multiplicative structure allows for \\emph{decoding}, resembling the decoding of Reed-Solomon codes and al...

Fast decoding algorithms for geometric coded apertures

International Nuclear Information System (INIS)

Byard, Kevin

2015-01-01

Fast decoding algorithms are described for the class of coded aperture designs known as geometric coded apertures which were introduced by Gourlay and Stephen. When compared to the direct decoding method, the algorithms significantly reduce the number of calculations required when performing the decoding for these apertures and hence speed up the decoding process. Experimental tests confirm the efficacy of these fast algorithms, demonstrating a speed up of approximately two to three orders of magnitude over direct decoding.

FPGA implementation of low complexity LDPC iterative decoder

Science.gov (United States)

Verma, Shivani; Sharma, Sanjay

2016-07-01

Low-density parity-check (LDPC) codes, proposed by Gallager, emerged as a class of codes which can yield very good performance on the additive white Gaussian noise channel as well as on the binary symmetric channel. LDPC codes have gained lots of importance due to their capacity achieving property and excellent performance in the noisy channel. Belief propagation (BP) algorithm and its approximations, most notably min-sum, are popular iterative decoding algorithms used for LDPC and turbo codes. The trade-off between the hardware complexity and the decoding throughput is a critical factor in the implementation of the practical decoder. This article presents introduction to LDPC codes and its various decoding algorithms followed by realisation of LDPC decoder by using simplified message passing algorithm and partially parallel decoder architecture. Simplified message passing algorithm has been proposed for trade-off between low decoding complexity and decoder performance. It greatly reduces the routing and check node complexity of the decoder. Partially parallel decoder architecture possesses high speed and reduced complexity. The improved design of the decoder possesses a maximum symbol throughput of 92.95 Mbps and a maximum of 18 decoding iterations. The article presents implementation of 9216 bits, rate-1/2, (3, 6) LDPC decoder on Xilinx XC3D3400A device from Spartan-3A DSP family.

Concatenated coding system with iterated sequential inner decoding

DEFF Research Database (Denmark)

Jensen, Ole Riis; Paaske, Erik

1995-01-01

We describe a concatenated coding system with iterated sequential inner decoding. The system uses convolutional codes of very long constraint length and operates on iterations between an inner Fano decoder and an outer Reed-Solomon decoder......We describe a concatenated coding system with iterated sequential inner decoding. The system uses convolutional codes of very long constraint length and operates on iterations between an inner Fano decoder and an outer Reed-Solomon decoder...

High-Speed Soft-Decision Decoding of Two Reed-Muller Codes

Science.gov (United States)

Lin, Shu; Uehara, Gregory T.

1996-01-01

In his research, we have proposed the (64, 40, 8) subcode of the third-order Reed-Muller (RM) code to NASA for high-speed satellite communications. This RM subcode can be used either alone or as an inner code of a concatenated coding system with the NASA standard (255, 233, 33) Reed-Solomon (RS) code as the outer code to achieve high performance (or low bit-error rate) with reduced decoding complexity. It can also be used as a component code in a multilevel bandwidth efficient coded modulation system to achieve reliable bandwidth efficient data transmission. This report will summarize the key progress we have made toward achieving our eventual goal of implementing a decoder system based upon this code. In the first phase of study, we investigated the complexities of various sectionalized trellis diagrams for the proposed (64, 40, 8) RNI subcode. We found a specific 8-trellis diagram for this code which requires the least decoding complexity with a high possibility of achieving a decoding speed of 600 M bits per second (Mbps). The combination of a large number of states and a hi ch data rate will be made possible due to the utilization of a high degree of parallelism throughout the architecture. This trellis diagram will be presented and briefly described. In the second phase of study which was carried out through the past year, we investigated circuit architectures to determine the feasibility of VLSI implementation of a high-speed Viterbi decoder based on this 8-section trellis diagram. We began to examine specific design and implementation approaches to implement a fully custom integrated circuit (IC) which will be a key building block for a decoder system implementation. The key results will be presented in this report. This report will be divided into three primary sections. First, we will briefly describe the system block diagram in which the proposed decoder is assumed to be operating and present some of the key architectural approaches being used to

Ultrahigh Error Threshold for Surface Codes with Biased Noise

Science.gov (United States)

Tuckett, David K.; Bartlett, Stephen D.; Flammia, Steven T.

2018-02-01

We show that a simple modification of the surface code can exhibit an enormous gain in the error correction threshold for a noise model in which Pauli Z errors occur more frequently than X or Y errors. Such biased noise, where dephasing dominates, is ubiquitous in many quantum architectures. In the limit of pure dephasing noise we find a threshold of 43.7(1)% using a tensor network decoder proposed by Bravyi, Suchara, and Vargo. The threshold remains surprisingly large in the regime of realistic noise bias ratios, for example 28.2(2)% at a bias of 10. The performance is, in fact, at or near the hashing bound for all values of the bias. The modified surface code still uses only weight-4 stabilizers on a square lattice, but merely requires measuring products of Y instead of Z around the faces, as this doubles the number of useful syndrome bits associated with the dominant Z errors. Our results demonstrate that large efficiency gains can be found by appropriately tailoring codes and decoders to realistic noise models, even under the locality constraints of topological codes.

Soft-decision decoding of RS codes

DEFF Research Database (Denmark)

Justesen, Jørn

2005-01-01

By introducing a few simplifying assumptions we derive a simple condition for successful decoding using the Koetter-Vardy algorithm for soft-decision decoding of RS codes. We show that the algorithm has a significant advantage over hard decision decoding when the code rate is low, when two or more...

Complementary Walsh-Hadamard coded optical CDMA coder/decoders structured over arrayed-waveguide grating routers

Science.gov (United States)

Huang, Jen-Fa; Yang, Chao-Chin; Tseng, Shin-Pin

2004-01-01

In this paper, an optical code-division multiple-access (OCDMA) system with complementary Walsh-Hadamard coded optical encoder/decoder configuration structured over arrayed-waveguide grating (AWG) routers is examined. In the proposed system, each network user requires only two AWG routers to accomplish spectral encoding and decoding for complementary keying, thus, resulting a simpler and low cost system. Performance of the proposed system is analyzed by taking the effect of phase-induced intensity noise into account. The result indicates that the established system not only preserves the capability of suppressing multiple-access interference (MAI), but also improves bit-error-rate performance as compared to the conventional coders employing simple on-off keying.

Video coding for decoding power-constrained embedded devices

Science.gov (United States)

Lu, Ligang; Sheinin, Vadim

2004-01-01

Low power dissipation and fast processing time are crucial requirements for embedded multimedia devices. This paper presents a technique in video coding to decrease the power consumption at a standard video decoder. Coupled with a small dedicated video internal memory cache on a decoder, the technique can substantially decrease the amount of data traffic to the external memory at the decoder. A decrease in data traffic to the external memory at decoder will result in multiple benefits: faster real-time processing and power savings. The encoder, given prior knowledge of the decoder"s dedicated video internal memory cache management scheme, regulates its choice of motion compensated predictors to reduce the decoder"s external memory accesses. This technique can be used in any standard or proprietary encoder scheme to generate a compliant output bit stream decodable by standard CPU-based and dedicated hardware-based decoders for power savings with the best quality-power cost trade off. Our simulation results show that with a relatively small amount of dedicated video internal memory cache, the technique may decrease the traffic between CPU and external memory over 50%.

A novel parallel pipeline structure of VP9 decoder

Science.gov (United States)

Qin, Huabiao; Chen, Wu; Yi, Sijun; Tan, Yunfei; Yi, Huan

2018-04-01

To improve the efficiency of VP9 decoder, a novel parallel pipeline structure of VP9 decoder is presented in this paper. According to the decoding workflow, VP9 decoder can be divided into sub-modules which include entropy decoding, inverse quantization, inverse transform, intra prediction, inter prediction, deblocking and pixel adaptive compensation. By analyzing the computing time of each module, hotspot modules are located and the causes of low efficiency of VP9 decoder can be found. Then, a novel pipeline decoder structure is designed by using mixed parallel decoding methods of data division and function division. The experimental results show that this structure can greatly improve the decoding efficiency of VP9.

The complete structure of the chloroplast 70S ribosome in complex with translation factor pY.

Science.gov (United States)

Bieri, Philipp; Leibundgut, Marc; Saurer, Martin; Boehringer, Daniel; Ban, Nenad

2017-02-15

Chloroplasts are cellular organelles of plants and algae that are responsible for energy conversion and carbon fixation by the photosynthetic reaction. As a consequence of their endosymbiotic origin, they still contain their own genome and the machinery for protein biosynthesis. Here, we present the atomic structure of the chloroplast 70S ribosome prepared from spinach leaves and resolved by cryo-EM at 3.4 Å resolution. The complete structure reveals the features of the 4.5S rRNA, which probably evolved by the fragmentation of the 23S rRNA, and all five plastid-specific ribosomal proteins. These proteins, required for proper assembly and function of the chloroplast translation machinery, bind and stabilize rRNA including regions that only exist in the chloroplast ribosome. Furthermore, the structure reveals plastid-specific extensions of ribosomal proteins that extensively remodel the mRNA entry and exit site on the small subunit as well as the polypeptide tunnel exit and the putative binding site of the signal recognition particle on the large subunit. The translation factor pY, involved in light- and temperature-dependent control of protein synthesis, is bound to the mRNA channel of the small subunit and interacts with 16S rRNA nucleotides at the A-site and P-site, where it protects the decoding centre and inhibits translation by preventing tRNA binding. The small subunit is locked by pY in a non-rotated state, in which the intersubunit bridges to the large subunit are stabilized. © 2016 The Authors. Published under the terms of the CC BY NC ND 4.0 license.

Evaluation framework for K-best sphere decoders

KAUST Repository

Shen, Chungan; Eltawil, Ahmed M.; Salama, Khaled N.

2010-01-01

or receive antennas. Tree-searching type decoder structures such as Sphere decoder and K-best decoder present an interesting trade-off between complexity and performance. Many algorithmic developments and VLSI implementations have been reported in literature

In silico modelling and analysis of ribosome kinetics and aa-tRNA competition

NARCIS (Netherlands)

Bošnački, D.; Pronk, T.E.; de Vink, E.P.

2008-01-01

We present a formal analysis of ribosome kinetics using probabilistic model checking and the tool Prism. We compute different parameters of the model, like probabilities of translation errors and average insertion times per codon. The model predicts strong correlation to the quotient of the

LDPC Decoding on GPU for Mobile Device

Directory of Open Access Journals (Sweden)

Yiqin Lu

2016-01-01

Full Text Available A flexible software LDPC decoder that exploits data parallelism for simultaneous multicode words decoding on the mobile device is proposed in this paper, supported by multithreading on OpenCL based graphics processing units. By dividing the check matrix into several parts to make full use of both the local memory and private memory on GPU and properly modify the code capacity each time, our implementation on a mobile phone shows throughputs above 100 Mbps and delay is less than 1.6 millisecond in decoding, which make high-speed communication like video calling possible. To realize efficient software LDPC decoding on the mobile device, the LDPC decoding feature on communication baseband chip should be replaced to save the cost and make it easier to upgrade decoder to be compatible with a variety of channel access schemes.

The serial message-passing schedule for LDPC decoding algorithms

Science.gov (United States)

Liu, Mingshan; Liu, Shanshan; Zhou, Yuan; Jiang, Xue

2015-12-01

The conventional message-passing schedule for LDPC decoding algorithms is the so-called flooding schedule. It has the disadvantage that the updated messages cannot be used until next iteration, thus reducing the convergence speed . In this case, the Layered Decoding algorithm (LBP) based on serial message-passing schedule is proposed. In this paper the decoding principle of LBP algorithm is briefly introduced, and then proposed its two improved algorithms, the grouped serial decoding algorithm (Grouped LBP) and the semi-serial decoding algorithm .They can improve LBP algorithm's decoding speed while maintaining a good decoding performance.

Threshold Multi Split-Row algorithm for decoding irregular LDPC codes

Directory of Open Access Journals (Sweden)

Chakir Aqil

2017-12-01

Full Text Available In this work, we propose a new threshold multi split-row algorithm in order to improve the multi split-row algorithm for LDPC irregular codes decoding. We give a complete description of our algorithm as well as its advantages for the LDPC codes. The simulation results over an additive white gaussian channel show that an improvement in code error performance between 0.4 dB and 0.6 dB compared to the multi split-row algorithm.

Decoding communities in networks.

Science.gov (United States)

Radicchi, Filippo

2018-02-01

According to a recent information-theoretical proposal, the problem of defining and identifying communities in networks can be interpreted as a classical communication task over a noisy channel: memberships of nodes are information bits erased by the channel, edges and nonedges in the network are parity bits introduced by the encoder but degraded through the channel, and a community identification algorithm is a decoder. The interpretation is perfectly equivalent to the one at the basis of well-known statistical inference algorithms for community detection. The only difference in the interpretation is that a noisy channel replaces a stochastic network model. However, the different perspective gives the opportunity to take advantage of the rich set of tools of coding theory to generate novel insights on the problem of community detection. In this paper, we illustrate two main applications of standard coding-theoretical methods to community detection. First, we leverage a state-of-the-art decoding technique to generate a family of quasioptimal community detection algorithms. Second and more important, we show that the Shannon's noisy-channel coding theorem can be invoked to establish a lower bound, here named as decodability bound, for the maximum amount of noise tolerable by an ideal decoder to achieve perfect detection of communities. When computed for well-established synthetic benchmarks, the decodability bound explains accurately the performance achieved by the best community detection algorithms existing on the market, telling us that only little room for their improvement is still potentially left.

Decoding communities in networks

Science.gov (United States)

Radicchi, Filippo

2018-02-01

According to a recent information-theoretical proposal, the problem of defining and identifying communities in networks can be interpreted as a classical communication task over a noisy channel: memberships of nodes are information bits erased by the channel, edges and nonedges in the network are parity bits introduced by the encoder but degraded through the channel, and a community identification algorithm is a decoder. The interpretation is perfectly equivalent to the one at the basis of well-known statistical inference algorithms for community detection. The only difference in the interpretation is that a noisy channel replaces a stochastic network model. However, the different perspective gives the opportunity to take advantage of the rich set of tools of coding theory to generate novel insights on the problem of community detection. In this paper, we illustrate two main applications of standard coding-theoretical methods to community detection. First, we leverage a state-of-the-art decoding technique to generate a family of quasioptimal community detection algorithms. Second and more important, we show that the Shannon's noisy-channel coding theorem can be invoked to establish a lower bound, here named as decodability bound, for the maximum amount of noise tolerable by an ideal decoder to achieve perfect detection of communities. When computed for well-established synthetic benchmarks, the decodability bound explains accurately the performance achieved by the best community detection algorithms existing on the market, telling us that only little room for their improvement is still potentially left.

Strictly local one-dimensional topological quantum error correction with symmetry-constrained cellular automata

Directory of Open Access Journals (Sweden)

Nicolai Lang, Hans Peter Büchler

2018-01-01

Full Text Available Active quantum error correction on topological codes is one of the most promising routes to long-term qubit storage. In view of future applications, the scalability of the used decoding algorithms in physical implementations is crucial. In this work, we focus on the one-dimensional Majorana chain and construct a strictly local decoder based on a self-dual cellular automaton. We study numerically and analytically its performance and exploit these results to contrive a scalable decoder with exponentially growing decoherence times in the presence of noise. Our results pave the way for scalable and modular designs of actively corrected one-dimensional topological quantum memories.

General Purpose Graphics Processing Unit Based High-Rate Rice Decompression and Reed-Solomon Decoding

Energy Technology Data Exchange (ETDEWEB)

Loughry, Thomas A. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

2015-02-01

As the volume of data acquired by space-based sensors increases, mission data compression/decompression and forward error correction code processing performance must likewise scale. This competency development effort was explored using the General Purpose Graphics Processing Unit (GPGPU) to accomplish high-rate Rice Decompression and high-rate Reed-Solomon (RS) decoding at the satellite mission ground station. Each algorithm was implemented and benchmarked on a single GPGPU. Distributed processing across one to four GPGPUs was also investigated. The results show that the GPGPU has considerable potential for performing satellite communication Data Signal Processing, with three times or better performance improvements and up to ten times reduction in cost over custom hardware, at least in the case of Rice Decompression and Reed-Solomon Decoding.

Interior point decoding for linear vector channels

International Nuclear Information System (INIS)

Wadayama, T

2008-01-01

In this paper, a novel decoding algorithm for low-density parity-check (LDPC) codes based on convex optimization is presented. The decoding algorithm, called interior point decoding, is designed for linear vector channels. The linear vector channels include many practically important channels such as inter-symbol interference channels and partial response channels. It is shown that the maximum likelihood decoding (MLD) rule for a linear vector channel can be relaxed to a convex optimization problem, which is called a relaxed MLD problem

Interior point decoding for linear vector channels

Energy Technology Data Exchange (ETDEWEB)

Wadayama, T [Nagoya Institute of Technology, Gokiso, Showa-ku, Nagoya, Aichi, 466-8555 (Japan)], E-mail: wadayama@nitech.ac.jp

2008-01-15

In this paper, a novel decoding algorithm for low-density parity-check (LDPC) codes based on convex optimization is presented. The decoding algorithm, called interior point decoding, is designed for linear vector channels. The linear vector channels include many practically important channels such as inter-symbol interference channels and partial response channels. It is shown that the maximum likelihood decoding (MLD) rule for a linear vector channel can be relaxed to a convex optimization problem, which is called a relaxed MLD problem.

An Asynchronous Low Power and High Performance VLSI Architecture for Viterbi Decoder Implemented with Quasi Delay Insensitive Templates

Directory of Open Access Journals (Sweden)

T. Kalavathi Devi

2015-01-01

Full Text Available Convolutional codes are comprehensively used as Forward Error Correction (FEC codes in digital communication systems. For decoding of convolutional codes at the receiver end, Viterbi decoder is often used to have high priority. This decoder meets the demand of high speed and low power. At present, the design of a competent system in Very Large Scale Integration (VLSI technology requires these VLSI parameters to be finely defined. The proposed asynchronous method focuses on reducing the power consumption of Viterbi decoder for various constraint lengths using asynchronous modules. The asynchronous designs are based on commonly used Quasi Delay Insensitive (QDI templates, namely, Precharge Half Buffer (PCHB and Weak Conditioned Half Buffer (WCHB. The functionality of the proposed asynchronous design is simulated and verified using Tanner Spice (TSPICE in 0.25 µm, 65 nm, and 180 nm technologies of Taiwan Semiconductor Manufacture Company (TSMC. The simulation result illustrates that the asynchronous design techniques have 25.21% of power reduction compared to synchronous design and work at a speed of 475 MHz.

Triple-Error-Correcting Codec ASIC

Science.gov (United States)

Jones, Robert E.; Segallis, Greg P.; Boyd, Robert

1994-01-01

Coder/decoder constructed on single integrated-circuit chip. Handles data in variety of formats at rates up to 300 Mbps, correcting up to 3 errors per data block of 256 to 512 bits. Helps reduce cost of transmitting data. Useful in many high-data-rate, bandwidth-limited communication systems such as; personal communication networks, cellular telephone networks, satellite communication systems, high-speed computing networks, broadcasting, and high-reliability data-communication links.

Photonic entanglement-assisted quantum low-density parity-check encoders and decoders.

Science.gov (United States)

Djordjevic, Ivan B

2010-05-01

I propose encoder and decoder architectures for entanglement-assisted (EA) quantum low-density parity-check (LDPC) codes suitable for all-optical implementation. I show that two basic gates needed for EA quantum error correction, namely, controlled-NOT (CNOT) and Hadamard gates can be implemented based on Mach-Zehnder interferometer. In addition, I show that EA quantum LDPC codes from balanced incomplete block designs of unitary index require only one entanglement qubit to be shared between source and destination.

A class of Sudan-decodable codes

DEFF Research Database (Denmark)

Nielsen, Rasmus Refslund

2000-01-01

In this article, Sudan's algorithm is modified into an efficient method to list-decode a class of codes which can be seen as a generalization of Reed-Solomon codes. The algorithm is specialized into a very efficient method for unique decoding. The code construction can be generalized based...... on algebraic-geometry codes and the decoding algorithms are generalized accordingly. Comparisons with Reed-Solomon and Hermitian codes are made....

Brain-to-text: Decoding spoken phrases from phone representations in the brain

Directory of Open Access Journals (Sweden)

Christian eHerff

2015-06-01

Full Text Available It has long been speculated whether communication between humans and machines based on natural speech related cortical activity is possible. Over the past decade, studies have suggested that it is feasible to recognize isolated aspects of speech from neural signals, such as auditory features, phones or one of a few isolated words. However, until now it remained an unsolved challenge to decode continuously spoken speech from the neural substrate associated with speech and language processing. Here, we show for the first time that continuously spoken speech can be decoded into the expressed words from intracranial electrocorticographic (ECoG recordings. Specifically, we implemented a system, which we call Brain-To-Text that models single phones, employs techniques from automatic speech recognition (ASR, and thereby transforms brain activity while speaking into the corresponding textual representation. Our results demonstrate that our system achieved word error rates as low as 25% and phone error rates below 50%. Additionally, our approach contributes to the current understanding of the neural basis of continuous speech production by identifying those cortical regions that hold substantial information about individual phones. In conclusion, the Brain-To-Text system described in this paper represents an important step towards human-machine communication based on imagined speech.

Correcting quantum errors with entanglement.

Science.gov (United States)

Brun, Todd; Devetak, Igor; Hsieh, Min-Hsiu

2006-10-20

We show how entanglement shared between encoder and decoder can simplify the theory of quantum error correction. The entanglement-assisted quantum codes we describe do not require the dual-containing constraint necessary for standard quantum error-correcting codes, thus allowing us to "quantize" all of classical linear coding theory. In particular, efficient modern classical codes that attain the Shannon capacity can be made into entanglement-assisted quantum codes attaining the hashing bound (closely related to the quantum capacity). For systems without large amounts of shared entanglement, these codes can also be used as catalytic codes, in which a small amount of initial entanglement enables quantum communication.

On Rational Interpolation-Based List-Decoding and List-Decoding Binary Goppa Codes

DEFF Research Database (Denmark)

Beelen, Peter; Høholdt, Tom; Nielsen, Johan Sebastian Rosenkilde

2013-01-01

We derive the Wu list-decoding algorithm for generalized Reed–Solomon (GRS) codes by using Gröbner bases over modules and the Euclidean algorithm as the initial algorithm instead of the Berlekamp–Massey algorithm. We present a novel method for constructing the interpolation polynomial fast. We gi...... and a duality in the choice of parameters needed for decoding, both in the case of GRS codes and in the case of Goppa codes....

Population Decoding of Motor Cortical Activity using a Generalized Linear Model with Hidden States

Science.gov (United States)

Lawhern, Vernon; Wu, Wei; Hatsopoulos, Nicholas G.; Paninski, Liam

2010-01-01

Generalized linear models (GLMs) have been developed for modeling and decoding population neuronal spiking activity in the motor cortex. These models provide reasonable characterizations between neural activity and motor behavior. However, they lack a description of movement-related terms which are not observed directly in these experiments, such as muscular activation, the subject's level of attention, and other internal or external states. Here we propose to include a multi-dimensional hidden state to address these states in a GLM framework where the spike count at each time is described as a function of the hand state (position, velocity, and acceleration), truncated spike history, and the hidden state. The model can be identified by an Expectation-Maximization algorithm. We tested this new method in two datasets where spikes were simultaneously recorded using a multi-electrode array in the primary motor cortex of two monkeys. It was found that this method significantly improves the model-fitting over the classical GLM, for hidden dimensions varying from 1 to 4. This method also provides more accurate decoding of hand state (lowering the Mean Square Error by up to 29% in some cases), while retaining real-time computational efficiency. These improvements on representation and decoding over the classical GLM model suggest that this new approach could contribute as a useful tool to motor cortical decoding and prosthetic applications. PMID:20359500

Encoder-decoder optimization for brain-computer interfaces.

Science.gov (United States)

Merel, Josh; Pianto, Donald M; Cunningham, John P; Paninski, Liam

2015-06-01

Neuroprosthetic brain-computer interfaces are systems that decode neural activity into useful control signals for effectors, such as a cursor on a computer screen. It has long been recognized that both the user and decoding system can adapt to increase the accuracy of the end effector. Co-adaptation is the process whereby a user learns to control the system in conjunction with the decoder adapting to learn the user's neural patterns. We provide a mathematical framework for co-adaptation and relate co-adaptation to the joint optimization of the user's control scheme ("encoding model") and the decoding algorithm's parameters. When the assumptions of that framework are respected, co-adaptation cannot yield better performance than that obtainable by an optimal initial choice of fixed decoder, coupled with optimal user learning. For a specific case, we provide numerical methods to obtain such an optimized decoder. We demonstrate our approach in a model brain-computer interface system using an online prosthesis simulator, a simple human-in-the-loop pyschophysics setup which provides a non-invasive simulation of the BCI setting. These experiments support two claims: that users can learn encoders matched to fixed, optimal decoders and that, once learned, our approach yields expected performance advantages.

Encoder-decoder optimization for brain-computer interfaces.

Directory of Open Access Journals (Sweden)

Josh Merel

2015-06-01

Full Text Available Neuroprosthetic brain-computer interfaces are systems that decode neural activity into useful control signals for effectors, such as a cursor on a computer screen. It has long been recognized that both the user and decoding system can adapt to increase the accuracy of the end effector. Co-adaptation is the process whereby a user learns to control the system in conjunction with the decoder adapting to learn the user's neural patterns. We provide a mathematical framework for co-adaptation and relate co-adaptation to the joint optimization of the user's control scheme ("encoding model" and the decoding algorithm's parameters. When the assumptions of that framework are respected, co-adaptation cannot yield better performance than that obtainable by an optimal initial choice of fixed decoder, coupled with optimal user learning. For a specific case, we provide numerical methods to obtain such an optimized decoder. We demonstrate our approach in a model brain-computer interface system using an online prosthesis simulator, a simple human-in-the-loop pyschophysics setup which provides a non-invasive simulation of the BCI setting. These experiments support two claims: that users can learn encoders matched to fixed, optimal decoders and that, once learned, our approach yields expected performance advantages.

FPGA Realization of Memory 10 Viterbi Decoder

DEFF Research Database (Denmark)

Paaske, Erik; Bach, Thomas Bo; Andersen, Jakob Dahl

1997-01-01

sequence mode when feedback from the Reed-Solomon decoder is available. The Viterbi decoder is realized using two Altera FLEX 10K50 FPGA's. The overall operating speed is 30 kbit/s, and since up to three iterations are performed for each frame and only one decoder is used, the operating speed...

When less is more: 'slicing' sequencing data improves read decoding accuracy and de novo assembly quality.

Science.gov (United States)

Lonardi, Stefano; Mirebrahim, Hamid; Wanamaker, Steve; Alpert, Matthew; Ciardo, Gianfranco; Duma, Denisa; Close, Timothy J

2015-09-15

As the invention of DNA sequencing in the 70s, computational biologists have had to deal with the problem of de novo genome assembly with limited (or insufficient) depth of sequencing. In this work, we investigate the opposite problem, that is, the challenge of dealing with excessive depth of sequencing. We explore the effect of ultra-deep sequencing data in two domains: (i) the problem of decoding reads to bacterial artificial chromosome (BAC) clones (in the context of the combinatorial pooling design we have recently proposed), and (ii) the problem of de novo assembly of BAC clones. Using real ultra-deep sequencing data, we show that when the depth of sequencing increases over a certain threshold, sequencing errors make these two problems harder and harder (instead of easier, as one would expect with error-free data), and as a consequence the quality of the solution degrades with more and more data. For the first problem, we propose an effective solution based on 'divide and conquer': we 'slice' a large dataset into smaller samples of optimal size, decode each slice independently, and then merge the results. Experimental results on over 15 000 barley BACs and over 4000 cowpea BACs demonstrate a significant improvement in the quality of the decoding and the final assembly. For the second problem, we show for the first time that modern de novo assemblers cannot take advantage of ultra-deep sequencing data. Python scripts to process slices and resolve decoding conflicts are available from http://goo.gl/YXgdHT; software Hashfilter can be downloaded from http://goo.gl/MIyZHs stelo@cs.ucr.edu or timothy.close@ucr.edu Supplementary data are available at Bioinformatics online. © The Author 2015. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

High Speed Frame Synchronization and Viterbi Decoding

DEFF Research Database (Denmark)

Paaske, Erik; Justesen, Jørn; Larsen, Knud J.

1996-01-01

The purpose of Phase 1 of the study is to describe the system structure and algorithms in sufficient detail to allow drawing the high level architecture of units containing frame synchronization and Viterbi decoding. The systems we consider are high data rate space communication systems. Also...... components. Node synchronization performed within a Viterbi decoder is discussed, and algorithms for frame synchronization are described and analyzed. We present a list of system configurations that we find potentially useful. Further, the high level architecture of units that contain frame synchronization...... and various other functions needed in a complete system is presented. Two such units are described, one for placement before the Viterbi decoder and another for placement after the decoder. The high level architectures of three possible implementations of Viterbi decoders are described: The first...

High Speed Frame Synchronization and Viterbi Decoding

DEFF Research Database (Denmark)

Paaske, Erik; Justesen, Jørn; Larsen, Knud J.

1998-01-01

The study has been divided into two phases. The purpose of Phase 1 of the study was to describe the system structure and algorithms in sufficient detail to allow drawing the high level architecture of units containing frame synchronization and Viterbi decoding. After selection of which specific...... potentially useful.Algorithms for frame synchronization are described and analyzed. Further, the high level architecture of units that contain frame synchronization and various other functions needed in a complete system is presented. Two such units are described, one for placement before the Viterbi decoder...... towards a realization in an FPGA.Node synchronization performed within a Viterbi decoder is discussed, and the high level architectures of three possible implementations of Viterbi decoders are described: The first implementation uses a number of commercially available decoders while the the two others...

A Scalable Architecture of a Structured LDPC Decoder

Science.gov (United States)

Lee, Jason Kwok-San; Lee, Benjamin; Thorpe, Jeremy; Andrews, Kenneth; Dolinar, Sam; Hamkins, Jon

2004-01-01

We present a scalable decoding architecture for a certain class of structured LDPC codes. The codes are designed using a small (n,r) protograph that is replicated Z times to produce a decoding graph for a (Z x n, Z x r) code. Using this architecture, we have implemented a decoder for a (4096,2048) LDPC code on a Xilinx Virtex-II 2000 FPGA, and achieved decoding speeds of 31 Mbps with 10 fixed iterations. The implemented message-passing algorithm uses an optimized 3-bit non-uniform quantizer that operates with 0.2dB implementation loss relative to a floating point decoder.

Evaluation framework for K-best sphere decoders

KAUST Repository

Shen, Chungan

2010-08-01

While Maximum-Likelihood (ML) is the optimum decoding scheme for most communication scenarios, practical implementation difficulties limit its use, especially for Multiple Input Multiple Output (MIMO) systems with a large number of transmit or receive antennas. Tree-searching type decoder structures such as Sphere decoder and K-best decoder present an interesting trade-off between complexity and performance. Many algorithmic developments and VLSI implementations have been reported in literature with widely varying performance to area and power metrics. In this semi-tutorial paper we present a holistic view of different Sphere decoding techniques and K-best decoding techniques, identifying the key algorithmic and implementation trade-offs. We establish a consistent benchmark framework to investigate and compare the delay cost, power cost, and power-delay-product cost incurred by each method. Finally, using the framework, we propose and analyze a novel architecture and compare that to other published approaches. Our goal is to explicitly elucidate the overall advantages and disadvantages of each proposed algorithms in one coherent framework. © 2010 World Scientific Publishing Company.

An LDPC decoder architecture for wireless sensor network applications.

Science.gov (United States)

Biroli, Andrea Dario Giancarlo; Martina, Maurizio; Masera, Guido

2012-01-01

The pervasive use of wireless sensors in a growing spectrum of human activities reinforces the need for devices with low energy dissipation. In this work, coded communication between a couple of wireless sensor devices is considered as a method to reduce the dissipated energy per transmitted bit with respect to uncoded communication. Different Low Density Parity Check (LDPC) codes are considered to this purpose and post layout results are shown for a low-area low-energy decoder, which offers percentage energy savings with respect to the uncoded solution in the range of 40%-80%, depending on considered environment, distance and bit error rate.

A Novel Modified Algorithm with Reduced Complexity LDPC Code Decoder

Directory of Open Access Journals (Sweden)

Song Yang

2014-10-01

Full Text Available A novel efficient decoding algorithm reduced the sum-product algorithm (SPA Complexity with LPDC code is proposed. Base on the hyperbolic tangent rule, modified the Check node update with two horizontal process, which have similar calculation, Motivated by the finding that sun- min (MS algorithm reduce the complexity reducing the approximation error in the horizontal process, simplify the information weight small part. Compared with the exiting approximations, the proposed method is less computational complexity than SPA algorithm. Simulation results show that the author algorithm can achieve performance very close SPA.

Orientation decoding: Sense in spirals?

Science.gov (United States)

Clifford, Colin W G; Mannion, Damien J

2015-04-15

The orientation of a visual stimulus can be successfully decoded from the multivariate pattern of fMRI activity in human visual cortex. Whether this capacity requires coarse-scale orientation biases is controversial. We and others have advocated the use of spiral stimuli to eliminate a potential coarse-scale bias-the radial bias toward local orientations that are collinear with the centre of gaze-and hence narrow down the potential coarse-scale biases that could contribute to orientation decoding. The usefulness of this strategy is challenged by the computational simulations of Carlson (2014), who reported the ability to successfully decode spirals of opposite sense (opening clockwise or counter-clockwise) from the pooled output of purportedly unbiased orientation filters. Here, we elaborate the mathematical relationship between spirals of opposite sense to confirm that they cannot be discriminated on the basis of the pooled output of unbiased or radially biased orientation filters. We then demonstrate that Carlson's (2014) reported decoding ability is consistent with the presence of inadvertent biases in the set of orientation filters; biases introduced by their digital implementation and unrelated to the brain's processing of orientation. These analyses demonstrate that spirals must be processed with an orientation bias other than the radial bias for successful decoding of spiral sense. Copyright © 2014 Elsevier Inc. All rights reserved.

O2-GIDNC: Beyond instantly decodable network coding

KAUST Repository

Aboutorab, Neda

2013-06-01

In this paper, we are concerned with extending the graph representation of generalized instantly decodable network coding (GIDNC) to a more general opportunistic network coding (ONC) scenario, referred to as order-2 GIDNC (O2-GIDNC). In the O2-GIDNC scheme, receivers can store non-instantly decodable packets (NIDPs) comprising two of their missing packets, and use them in a systematic way for later decodings. Once this graph representation is found, it can be used to extend the GIDNC graph-based analyses to the proposed O2-GIDNC scheme with a limited increase in complexity. In the proposed O2-GIDNC scheme, the information of the stored NIDPs at the receivers and the decoding opportunities they create can be exploited to improve the broadcast completion time and decoding delay compared to traditional GIDNC scheme. The completion time and decoding delay minimizing algorithms that can operate on the new O2-GIDNC graph are further described. The simulation results show that our proposed O2-GIDNC improves the completion time and decoding delay performance of the traditional GIDNC. © 2013 IEEE.

On decoding of multi-level MPSK modulation codes

Science.gov (United States)

Lin, Shu; Gupta, Alok Kumar

1990-01-01

The decoding problem of multi-level block modulation codes is investigated. The hardware design of soft-decision Viterbi decoder for some short length 8-PSK block modulation codes is presented. An effective way to reduce the hardware complexity of the decoder by reducing the branch metric and path metric, using a non-uniform floating-point to integer mapping scheme, is proposed and discussed. The simulation results of the design are presented. The multi-stage decoding (MSD) of multi-level modulation codes is also investigated. The cases of soft-decision and hard-decision MSD are considered and their performance are evaluated for several codes of different lengths and different minimum squared Euclidean distances. It is shown that the soft-decision MSD reduces the decoding complexity drastically and it is suboptimum. The hard-decision MSD further simplifies the decoding while still maintaining a reasonable coding gain over the uncoded system, if the component codes are chosen properly. Finally, some basic 3-level 8-PSK modulation codes using BCH codes as component codes are constructed and their coding gains are found for hard decision multistage decoding.

Binary Systematic Network Coding for Progressive Packet Decoding

OpenAIRE

Jones, Andrew L.; Chatzigeorgiou, Ioannis; Tassi, Andrea

2015-01-01

We consider binary systematic network codes and investigate their capability of decoding a source message either in full or in part. We carry out a probability analysis, derive closed-form expressions for the decoding probability and show that systematic network coding outperforms conventional net- work coding. We also develop an algorithm based on Gaussian elimination that allows progressive decoding of source packets. Simulation results show that the proposed decoding algorithm can achieve ...

Power decoding Reed-Solomon codes up to the Johnson radius

DEFF Research Database (Denmark)

Rosenkilde, Johan Sebastian Heesemann

2018-01-01

Power decoding, or "decoding using virtual interleaving" is a technique for decoding Reed-Solomon codes up to the Sudan radius. Since the method's inception, it has been an open question if it is possible to use this approach to decode up to the Johnson radius - the decoding radius of the Guruswami...

Application of Beyond Bound Decoding for High Speed Optical Communications

DEFF Research Database (Denmark)

Li, Bomin; Larsen, Knud J.; Vegas Olmos, Juan José

2013-01-01

This paper studies the application of beyond bound decoding method for high speed optical communications. This hard-decision decoding method outperforms traditional minimum distance decoding method, with a total net coding gain of 10.36 dB.......This paper studies the application of beyond bound decoding method for high speed optical communications. This hard-decision decoding method outperforms traditional minimum distance decoding method, with a total net coding gain of 10.36 dB....

Error Resilient Video Compression Using Behavior Models

Directory of Open Access Journals (Sweden)

Jacco R. Taal

2004-03-01

Full Text Available Wireless and Internet video applications are inherently subjected to bit errors and packet errors, respectively. This is especially so if constraints on the end-to-end compression and transmission latencies are imposed. Therefore, it is necessary to develop methods to optimize the video compression parameters and the rate allocation of these applications that take into account residual channel bit errors. In this paper, we study the behavior of a predictive (interframe video encoder and model the encoders behavior using only the statistics of the original input data and of the underlying channel prone to bit errors. The resulting data-driven behavior models are then used to carry out group-of-pictures partitioning and to control the rate of the video encoder in such a way that the overall quality of the decoded video with compression and channel errors is optimized.

Polar Coding with CRC-Aided List Decoding

Science.gov (United States)

2015-08-01

TECHNICAL REPORT 2087 August 2015 Polar Coding with CRC-Aided List Decoding David Wasserman Approved...list decoding . RESULTS Our simulation results show that polar coding can produce results very similar to the FEC used in the Digital Video...standard. RECOMMENDATIONS In any application for which the DVB-S2 FEC is considered, polar coding with CRC-aided list decod - ing with N = 65536

5S rRNA and ribosome.

Science.gov (United States)

Gongadze, G M

2011-12-01

5S rRNA is an integral component of the ribosome of all living organisms. It is known that the ribosome without 5S rRNA is functionally inactive. However, the question about the specific role of this RNA in functioning of the translation apparatus is still open. This review presents a brief history of the discovery of 5S rRNA and studies of its origin and localization in the ribosome. The previously expressed hypotheses about the role of this RNA in the functioning of the ribosome are discussed considering the unique location of 5S rRNA in the ribosome and its intermolecular contacts. Based on analysis of the current data on ribosome structure and its functional complexes, the role of 5S rRNA as an intermediary between ribosome functional domains is discussed.

In vitro degradation of ribosomes.

Science.gov (United States)

Mora, G; Rivas, A

1976-12-01

The cytoplasmic ribosomes from Euglena gracilis var. bacillaris are found to be of two types taking into consideration their stability "in vitro". In the group of unstable ribosomes the large subunit is degraded. The other group apparently does not suffer any degradation under the conditions described. However the RNAs extracted from both types of ribosomes are degraded during sucrose density gradients. The degradation of the largest RNA species has been reported previously, but no comment has been made about the stability of the ribosome itself.

Decoding options and accuracy of translation of developmentally regulated UUA codon in Streptomyces: bioinformatic analysis.

Science.gov (United States)

Rokytskyy, Ihor; Koshla, Oksana; Fedorenko, Victor; Ostash, Bohdan

2016-01-01

The gene bldA for leucyl [Formula: see text] is known for almost 30 years as a key regulator of morphogenesis and secondary metabolism in genus Streptomyces. Codon UUA is the rarest one in Streptomyces genomes and is present exclusively in genes with auxiliary functions. Delayed accumulation of translation-competent [Formula: see text] is believed to confine the expression of UUA-containing transcripts to stationary phase. Implicit to the regulatory function of UUA codon is the assumption about high accuracy of its translation, e.g. the latter should not occur in the absence of cognate [Formula: see text]. However, a growing body of facts points to the possibility of mistranslation of UUA-containing transcripts in the bldA-deficient mutants. It is not known what type of near-cognate tRNA(s) may decode UUA in the absence of cognate tRNA in Streptomyces, and whether UUA possesses certain inherent properties (such as increased/decreased accuracy of decoding) that would favor its use for regulatory purposes. Here we took bioinformatic approach to address these questions. We catalogued the entire complement of tRNA genes from several relevant Streptomyces and identified genes for posttranscriptional modifications of tRNA that might be involved in UUA decoding by cognate and near-cognate tRNAs. Based on tRNA gene content in Streptomyces genomes, we propose possible scenarios of UUA codon mistranslation. UUA is not associated with an increased rate of missense errors as compared to other leucyl codons, contrasting general belief that low-abundant codons are more error-prone than the high-abundant ones.

Modified Decoding Algorithm of LLR-SPA

Directory of Open Access Journals (Sweden)

Zhongxun Wang

2014-09-01

Full Text Available In wireless sensor networks, the energy consumption is mainly occurred in the stage of information transmission. The Low Density Parity Check code can make full use of the channel information to save energy. Because of the widely used decoding algorithm of the Low Density Parity Check code, this paper proposes a new decoding algorithm which is based on the LLR-SPA (Sum-Product Algorithm in Log-Likelihood-domain to improve the accuracy of the decoding algorithm. In the modified algorithm, a piecewise linear function is used to approximate the complicated Jacobi correction term in LLR-SPA decoding algorithm. Construct the tangent by the tangency point to the function of Jacobi correction term, which is based on the first order Taylor Series. In this way, the proposed piecewise linear approximation offers almost a perfect match to the function of Jacobi correction term. Meanwhile, the proposed piecewise linear approximation could avoid the operation of logarithmic which is more suitable for practical application. The simulation results show that the proposed algorithm could improve the decoding accuracy greatly without noticeable variation of the computational complexity.

Error-correcting pairs for a public-key cryptosystem

International Nuclear Information System (INIS)

Pellikaan, Ruud; Márquez-Corbella, Irene

2017-01-01

Code-based Cryptography (CBC) is a powerful and promising alternative for quantum resistant cryptography. Indeed, together with lattice-based cryptography, multivariate cryptography and hash-based cryptography are the principal available techniques for post-quantum cryptography. CBC was first introduced by McEliece where he designed one of the most efficient Public-Key encryption schemes with exceptionally strong security guarantees and other desirable properties that still resist to attacks based on Quantum Fourier Transform and Amplitude Amplification. The original proposal, which remains unbroken, was based on binary Goppa codes. Later, several families of codes have been proposed in order to reduce the key size. Some of these alternatives have already been broken. One of the main requirements of a code-based cryptosystem is having high performance t -bounded decoding algorithms which is achieved in the case the code has a t -error-correcting pair (ECP). Indeed, those McEliece schemes that use GRS codes, BCH, Goppa and algebraic geometry codes are in fact using an error-correcting pair as a secret key. That is, the security of these Public-Key Cryptosystems is not only based on the inherent intractability of bounded distance decoding but also on the assumption that it is difficult to retrieve efficiently an error-correcting pair. In this paper, the class of codes with a t -ECP is proposed for the McEliece cryptosystem. Moreover, we study the hardness of distinguishing arbitrary codes from those having a t -error correcting pair. (paper)

The "periodic table" of the genetic code: A new way to look at the code and the decoding process.

Science.gov (United States)

Komar, Anton A

2016-01-01

Henri Grosjean and Eric Westhof recently presented an information-rich, alternative view of the genetic code, which takes into account current knowledge of the decoding process, including the complex nature of interactions between mRNA, tRNA and rRNA that take place during protein synthesis on the ribosome, and it also better reflects the evolution of the code. The new asymmetrical circular genetic code has a number of advantages over the traditional codon table and the previous circular diagrams (with a symmetrical/clockwise arrangement of the U, C, A, G bases). Most importantly, all sequence co-variances can be visualized and explained based on the internal logic of the thermodynamics of codon-anticodon interactions.

Ribosomal studies on the 70S ribosome of E.coli by means of neutron scattering

International Nuclear Information System (INIS)

Burkhardt, N.

1997-01-01

Ribosomes are ribonucleo-protein complexes, which catalyse proteinbiosynthesis in all living organisms. Currently, most of the structural models of the prokaryotic 70S ribosome rely on electron microscopy and describe mainly the outer shape of the particle. Neutron scattering can provide information on the internal structure of the ribosome. Parts of the structure can be contrasted for neutrons by means of an isotopic exchange of the naturally occurring hydrogen ( 1 H) for deuterium ( 2 H), allowing direct measurements in situ. Specifically deuterium-labeled ribosomes (E. coli) were prepared and analysed with neutron scattering. The biochemical methods were established and combined to a generally applicable preparation system. This allows labeling of all ribosomal components in any combination. A systematic analysis of the protein and RNA phases resulted in the development of a new model for the 70S ribosome. This model describes not only the outer shape of the particle, but displays also an experimentally determined internal protein-RNA distribution and the border of subunits for the first time (four-phase model; resolution: 50A). Models of the 70S ribosome from other studies were evaluated and ranked according to consistency with the measured scattering data. Applying a new neutron scattering technique of particular sensitivity, the proton-spin contrast-variation, single proteins could be measured and localized. The positions of the proteins S6 and S10 were determined, providing the first coordinates of protein mass centers within the 70S ribosome. (orig.) [de

Population decoding of motor cortical activity using a generalized linear model with hidden states.

Science.gov (United States)

Lawhern, Vernon; Wu, Wei; Hatsopoulos, Nicholas; Paninski, Liam

2010-06-15

Generalized linear models (GLMs) have been developed for modeling and decoding population neuronal spiking activity in the motor cortex. These models provide reasonable characterizations between neural activity and motor behavior. However, they lack a description of movement-related terms which are not observed directly in these experiments, such as muscular activation, the subject's level of attention, and other internal or external states. Here we propose to include a multi-dimensional hidden state to address these states in a GLM framework where the spike count at each time is described as a function of the hand state (position, velocity, and acceleration), truncated spike history, and the hidden state. The model can be identified by an Expectation-Maximization algorithm. We tested this new method in two datasets where spikes were simultaneously recorded using a multi-electrode array in the primary motor cortex of two monkeys. It was found that this method significantly improves the model-fitting over the classical GLM, for hidden dimensions varying from 1 to 4. This method also provides more accurate decoding of hand state (reducing the mean square error by up to 29% in some cases), while retaining real-time computational efficiency. These improvements on representation and decoding over the classical GLM model suggest that this new approach could contribute as a useful tool to motor cortical decoding and prosthetic applications. Copyright (c) 2010 Elsevier B.V. All rights reserved.

Direct migration motion estimation and mode decision to decoder for a low-complexity decoder Wyner-Ziv video coding

Science.gov (United States)

Lei, Ted Chih-Wei; Tseng, Fan-Shuo

2017-07-01

This paper addresses the problem of high-computational complexity decoding in traditional Wyner-Ziv video coding (WZVC). The key focus is the migration of two traditionally high-computationally complex encoder algorithms, namely motion estimation and mode decision. In order to reduce the computational burden in this process, the proposed architecture adopts the partial boundary matching algorithm and four flexible types of block mode decision at the decoder. This approach does away with the need for motion estimation and mode decision at the encoder. The experimental results show that the proposed padding block-based WZVC not only decreases decoder complexity to approximately one hundredth that of the state-of-the-art DISCOVER decoding but also outperforms DISCOVER codec by up to 3 to 4 dB.

Detection and Quantification of Ribosome Inhibition by Aminoglycoside Antibiotics in Living Bacteria Using an Orthogonal Ribosome-Controlled Fluorescent Reporter.

Science.gov (United States)

Huang, Shijie; Zhu, Xuechen; Melançon, Charles E

2016-01-15

The ribosome is the quintessential antibacterial drug target, with many structurally and mechanistically distinct classes of antibacterial agents acting by inhibiting ribosome function. Detecting and quantifying ribosome inhibition by small molecules and investigating their binding modes and mechanisms of action are critical to antibacterial drug discovery and development efforts. To develop a ribosome inhibition assay that is operationally simple, yet provides direct information on the drug target and the mechanism of action, we have developed engineered E. coli strains harboring an orthogonal ribosome-controlled green fluorescent protein (GFP) reporter that produce fluorescent signal when the orthogonal ribosome is inhibited. As a proof of concept, we demonstrate that these strains, when coexpressing homogeneous populations of aminoglycoside resistant ribosomes, act as sensitive and quantitative detectors of ribosome inhibition by a set of 12 structurally diverse aminoglycoside antibiotics. We suggest that this strategy can be extended to quantifying ribosome inhibition by other drug classes.

Decoding subjective mental states from fMRI activity patterns

International Nuclear Information System (INIS)

Tamaki, Masako; Kamitani, Yukiyasu

2011-01-01

In recent years, functional magnetic resonance imaging (fMRI) decoding has emerged as a powerful tool to read out detailed stimulus features from multi-voxel brain activity patterns. Moreover, the method has been extended to perform a primitive form of 'mind-reading,' by applying a decoder 'objectively' trained using stimulus features to more 'subjective' conditions. In this paper, we first introduce basic procedures for fMRI decoding based on machine learning techniques. Second, we discuss the source of information used for decoding, in particular, the possibility of extracting information from subvoxel neural structures. We next introduce two experimental designs for decoding subjective mental states: the 'objective-to-subjective design' and the 'subjective-to-subjective design.' Then, we illustrate recent studies on the decoding of a variety of mental states, such as, attention, awareness, decision making, memory, and mental imagery. Finally, we discuss the challenges and new directions of fMRI decoding. (author)

The ribosome can prevent aggregation of partially folded protein intermediates: studies using the Escherichia coli ribosome.

Directory of Open Access Journals (Sweden)

Bani Kumar Pathak

Full Text Available BACKGROUND: Molecular chaperones that support de novo folding of proteins under non stress condition are classified as chaperone 'foldases' that are distinct from chaperone' holdases' that provide high affinity binding platform for unfolded proteins and prevent their aggregation specifically under stress conditions. Ribosome, the cellular protein synthesis machine can act as a foldase chaperone that can bind unfolded proteins and release them in folding competent state. The peptidyl transferase center (PTC located in the domain V of the 23S rRNA of Escherichia coli ribosome (bDV RNA is the chaperoning center of the ribosome. It has been proposed that via specific interactions between the RNA and refolding proteins, the chaperone provides information for the correct folding of unfolded polypeptide chains. RESULTS: We demonstrate using Escherichia coli ribosome and variants of its domain V RNA that the ribosome can bind to partially folded intermediates of bovine carbonic anhydrase II (BCAII and lysozyme and suppress aggregation during their refolding. Using mutants of domain V RNA we demonstrate that the time for which the chaperone retains the bound protein is an important factor in determining its ability to suppress aggregation and/or support reactivation of protein. CONCLUSION: The ribosome can behave like a 'holdase' chaperone and has the ability to bind and hold back partially folded intermediate states of proteins from participating in the aggregation process. Since the ribosome is an essential organelle that is present in large numbers in all living cells, this ability of the ribosome provides an energetically inexpensive way to suppress cellular aggregation. Further, this ability of the ribosome might also be crucial in the context that the ribosome is one of the first chaperones to be encountered by a large nascent polypeptide chains that have a tendency to form partially folded intermediates immediately following their synthesis.

An evaluation of the effect of JPEG, JPEG2000, and H.264/AVC on CQR codes decoding process

Science.gov (United States)

Vizcarra Melgar, Max E.; Farias, Mylène C. Q.; Zaghetto, Alexandre

2015-02-01

This paper presents a binarymatrix code based on QR Code (Quick Response Code), denoted as CQR Code (Colored Quick Response Code), and evaluates the effect of JPEG, JPEG2000 and H.264/AVC compression on the decoding process. The proposed CQR Code has three additional colors (red, green and blue), what enables twice as much storage capacity when compared to the traditional black and white QR Code. Using the Reed-Solomon error-correcting code, the CQR Code model has a theoretical correction capability of 38.41%. The goal of this paper is to evaluate the effect that degradations inserted by common image compression algorithms have on the decoding process. Results show that a successful decoding process can be achieved for compression rates up to 0.3877 bits/pixel, 0.1093 bits/pixel and 0.3808 bits/pixel for JPEG, JPEG2000 and H.264/AVC formats, respectively. The algorithm that presents the best performance is the H.264/AVC, followed by the JPEG2000, and JPEG.

A Unified Approach to Restoration, Deinterlacing and Resolution Enhancement in Decoding MPEG-2 Video

DEFF Research Database (Denmark)

Forchhammer, Søren; Martins, Bo

2002-01-01

to the desired format. The processing involves an estimated quality of individual pixels based on MPEG image type and local quantization value. The mean-squared error (MSE) is reduced, compared to the directly decoded sequence, and annoying ringing artifacts, including mosquito noise, are effectively suppressed....... The superresolution pictures obtained by the algorithm are of much higher visual quality and have lower MSE than superresolution pictures obtained by simple spatial interpolation....

Interpolation decoding method with variable parameters for fractal image compression

International Nuclear Information System (INIS)

He Chuanjiang; Li Gaoping; Shen Xiaona

2007-01-01

The interpolation fractal decoding method, which is introduced by [He C, Yang SX, Huang X. Progressive decoding method for fractal image compression. IEE Proc Vis Image Signal Process 2004;3:207-13], involves generating progressively the decoded image by means of an interpolation iterative procedure with a constant parameter. It is well-known that the majority of image details are added at the first steps of iterations in the conventional fractal decoding; hence the constant parameter for the interpolation decoding method must be set as a smaller value in order to achieve a better progressive decoding. However, it needs to take an extremely large number of iterations to converge. It is thus reasonable for some applications to slow down the iterative process at the first stages of decoding and then to accelerate it afterwards (e.g., at some iteration as we need). To achieve the goal, this paper proposed an interpolation decoding scheme with variable (iteration-dependent) parameters and proved the convergence of the decoding process mathematically. Experimental results demonstrate that the proposed scheme has really achieved the above-mentioned goal

Sub-quadratic decoding of one-point hermitian codes

DEFF Research Database (Denmark)

Nielsen, Johan Sebastian Rosenkilde; Beelen, Peter

2015-01-01

We present the first two sub-quadratic complexity decoding algorithms for one-point Hermitian codes. The first is based on a fast realization of the Guruswami-Sudan algorithm using state-of-the-art algorithms from computer algebra for polynomial-ring matrix minimization. The second is a power...... decoding algorithm: an extension of classical key equation decoding which gives a probabilistic decoding algorithm up to the Sudan radius. We show how the resulting key equations can be solved by the matrix minimization algorithms from computer algebra, yielding similar asymptotic complexities....

Dynamics of intracellular information decoding.

Science.gov (United States)

Kobayashi, Tetsuya J; Kamimura, Atsushi

2011-10-01

A variety of cellular functions are robust even to substantial intrinsic and extrinsic noise in intracellular reactions and the environment that could be strong enough to impair or limit them. In particular, of substantial importance is cellular decision-making in which a cell chooses a fate or behavior on the basis of information conveyed in noisy external signals. For robust decoding, the crucial step is filtering out the noise inevitably added during information transmission. As a minimal and optimal implementation of such an information decoding process, the autocatalytic phosphorylation and autocatalytic dephosphorylation (aPadP) cycle was recently proposed. Here, we analyze the dynamical properties of the aPadP cycle in detail. We describe the dynamical roles of the stationary and short-term responses in determining the efficiency of information decoding and clarify the optimality of the threshold value of the stationary response and its information-theoretical meaning. Furthermore, we investigate the robustness of the aPadP cycle against the receptor inactivation time and intrinsic noise. Finally, we discuss the relationship among information decoding with information-dependent actions, bet-hedging and network modularity.

Decoding intention at sensorimotor timescales.

Directory of Open Access Journals (Sweden)

Mathew Salvaris

Full Text Available The ability to decode an individual's intentions in real time has long been a 'holy grail' of research on human volition. For example, a reliable method could be used to improve scientific study of voluntary action by allowing external probe stimuli to be delivered at different moments during development of intention and action. Several Brain Computer Interface applications have used motor imagery of repetitive actions to achieve this goal. These systems are relatively successful, but only if the intention is sustained over a period of several seconds; much longer than the timescales identified in psychophysiological studies for normal preparation for voluntary action. We have used a combination of sensorimotor rhythms and motor imagery training to decode intentions in a single-trial cued-response paradigm similar to those used in human and non-human primate motor control research. Decoding accuracy of over 0.83 was achieved with twelve participants. With this approach, we could decode intentions to move the left or right hand at sub-second timescales, both for instructed choices instructed by an external stimulus and for free choices generated intentionally by the participant. The implications for volition are considered.

Dynamics of intracellular information decoding

International Nuclear Information System (INIS)

Kobayashi, Tetsuya J; Kamimura, Atsushi

2011-01-01

A variety of cellular functions are robust even to substantial intrinsic and extrinsic noise in intracellular reactions and the environment that could be strong enough to impair or limit them. In particular, of substantial importance is cellular decision-making in which a cell chooses a fate or behavior on the basis of information conveyed in noisy external signals. For robust decoding, the crucial step is filtering out the noise inevitably added during information transmission. As a minimal and optimal implementation of such an information decoding process, the autocatalytic phosphorylation and autocatalytic dephosphorylation (aPadP) cycle was recently proposed. Here, we analyze the dynamical properties of the aPadP cycle in detail. We describe the dynamical roles of the stationary and short-term responses in determining the efficiency of information decoding and clarify the optimality of the threshold value of the stationary response and its information-theoretical meaning. Furthermore, we investigate the robustness of the aPadP cycle against the receptor inactivation time and intrinsic noise. Finally, we discuss the relationship among information decoding with information-dependent actions, bet-hedging and network modularity

Performance breakdown in optimal stimulus decoding.

Science.gov (United States)

Lubomir Kostal; Lansky, Petr; Pilarski, Stevan

2015-06-01

One of the primary goals of neuroscience is to understand how neurons encode and process information about their environment. The problem is often approached indirectly by examining the degree to which the neuronal response reflects the stimulus feature of interest. In this context, the methods of signal estimation and detection theory provide the theoretical limits on the decoding accuracy with which the stimulus can be identified. The Cramér-Rao lower bound on the decoding precision is widely used, since it can be evaluated easily once the mathematical model of the stimulus-response relationship is determined. However, little is known about the behavior of different decoding schemes with respect to the bound if the neuronal population size is limited. We show that under broad conditions the optimal decoding displays a threshold-like shift in performance in dependence on the population size. The onset of the threshold determines a critical range where a small increment in size, signal-to-noise ratio or observation time yields a dramatic gain in the decoding precision. We demonstrate the existence of such threshold regions in early auditory and olfactory information coding. We discuss the origin of the threshold effect and its impact on the design of effective coding approaches in terms of relevant population size.

FPGA implementation of high-performance QC-LDPC decoder for optical communications

Science.gov (United States)

Zou, Ding; Djordjevic, Ivan B.

2015-01-01

Forward error correction is as one of the key technologies enabling the next-generation high-speed fiber optical communications. Quasi-cyclic (QC) low-density parity-check (LDPC) codes have been considered as one of the promising candidates due to their large coding gain performance and low implementation complexity. In this paper, we present our designed QC-LDPC code with girth 10 and 25% overhead based on pairwise balanced design. By FPGAbased emulation, we demonstrate that the 5-bit soft-decision LDPC decoder can achieve 11.8dB net coding gain with no error floor at BER of 10-15 avoiding using any outer code or post-processing method. We believe that the proposed single QC-LDPC code is a promising solution for 400Gb/s optical communication systems and beyond.

Error-Resilient Unequal Error Protection of Fine Granularity Scalable Video Bitstreams

Science.gov (United States)

Cai, Hua; Zeng, Bing; Shen, Guobin; Xiong, Zixiang; Li, Shipeng

2006-12-01

This paper deals with the optimal packet loss protection issue for streaming the fine granularity scalable (FGS) video bitstreams over IP networks. Unlike many other existing protection schemes, we develop an error-resilient unequal error protection (ER-UEP) method that adds redundant information optimally for loss protection and, at the same time, cancels completely the dependency among bitstream after loss recovery. In our ER-UEP method, the FGS enhancement-layer bitstream is first packetized into a group of independent and scalable data packets. Parity packets, which are also scalable, are then generated. Unequal protection is finally achieved by properly shaping the data packets and the parity packets. We present an algorithm that can optimally allocate the rate budget between data packets and parity packets, together with several simplified versions that have lower complexity. Compared with conventional UEP schemes that suffer from bit contamination (caused by the bit dependency within a bitstream), our method guarantees successful decoding of all received bits, thus leading to strong error-resilience (at any fixed channel bandwidth) and high robustness (under varying and/or unclean channel conditions).

An LDPC Decoder Architecture for Wireless Sensor Network Applications

Science.gov (United States)

Giancarlo Biroli, Andrea Dario; Martina, Maurizio; Masera, Guido

2012-01-01

The pervasive use of wireless sensors in a growing spectrum of human activities reinforces the need for devices with low energy dissipation. In this work, coded communication between a couple of wireless sensor devices is considered as a method to reduce the dissipated energy per transmitted bit with respect to uncoded communication. Different Low Density Parity Check (LDPC) codes are considered to this purpose and post layout results are shown for a low-area low-energy decoder, which offers percentage energy savings with respect to the uncoded solution in the range of 40%–80%, depending on considered environment, distance and bit error rate. PMID:22438724

Implementasi Encoder dan Decoder Cyclic Redundancy Check Pada TMS320C6416T

Directory of Open Access Journals (Sweden)

Grace Natalia

2014-03-01

Full Text Available CRC merupakan metode yang paling populer digunakan saat ini karena kemampuanya paling baik dalam mendeteksi error. Pada Tugas Akhir ini memaparkan bagaimana CRC diimplementasikan pada TMS320C6416T. Evaluasi yang akan diteliti yaitu kinerja proses encoder dan decoder CRC sebagai fungsi Eb/No dari error per blok melalui kanal ideal AWGN  dengan modulasi BPSK serta melihat seberapa besar kemampuan CRC dalam mendeteksi kesalahan. Pengujian yang dilakukan melalui simulink matlab dan implementasi secara real ke dalam TMS320C6416T.  Adapun kode CRC yang dipilih yaitu CRC-8 dan CRC-16 dimana pada implementasi pada TMS dilakukan pengiriman sebesar 100.000 bit dalam 12.500 frame.  Hasil pengujian yang diperoleh yaitu jumlah error yang dideteksi pada CRC-8 rata-rata jumlah error adalah 2.750 frame dan rata-rata jumlah error bit informasi  1.957 bit. Sedangkan untuk CRC-16  rata-rata jumlah error adalah 3.520 frame dan rata-rata jumlah error per bit informasi yaitu 1.971 bit. Dari pengujian membuktikan bahwa kemampuan CRC-16 dalam menjaga keamanan data bit informasi jauh lebih baik dibandingkan dengan CRC-8.

Real-time SHVC software decoding with multi-threaded parallel processing

Science.gov (United States)

Gudumasu, Srinivas; He, Yuwen; Ye, Yan; He, Yong; Ryu, Eun-Seok; Dong, Jie; Xiu, Xiaoyu

2014-09-01

This paper proposes a parallel decoding framework for scalable HEVC (SHVC). Various optimization technologies are implemented on the basis of SHVC reference software SHM-2.0 to achieve real-time decoding speed for the two layer spatial scalability configuration. SHVC decoder complexity is analyzed with profiling information. The decoding process at each layer and the up-sampling process are designed in parallel and scheduled by a high level application task manager. Within each layer, multi-threaded decoding is applied to accelerate the layer decoding speed. Entropy decoding, reconstruction, and in-loop processing are pipeline designed with multiple threads based on groups of coding tree units (CTU). A group of CTUs is treated as a processing unit in each pipeline stage to achieve a better trade-off between parallelism and synchronization. Motion compensation, inverse quantization, and inverse transform modules are further optimized with SSE4 SIMD instructions. Simulations on a desktop with an Intel i7 processor 2600 running at 3.4 GHz show that the parallel SHVC software decoder is able to decode 1080p spatial 2x at up to 60 fps (frames per second) and 1080p spatial 1.5x at up to 50 fps for those bitstreams generated with SHVC common test conditions in the JCT-VC standardization group. The decoding performance at various bitrates with different optimization technologies and different numbers of threads are compared in terms of decoding speed and resource usage, including processor and memory.

High-throughput GPU-based LDPC decoding

Science.gov (United States)

Chang, Yang-Lang; Chang, Cheng-Chun; Huang, Min-Yu; Huang, Bormin

2010-08-01

Low-density parity-check (LDPC) code is a linear block code known to approach the Shannon limit via the iterative sum-product algorithm. LDPC codes have been adopted in most current communication systems such as DVB-S2, WiMAX, WI-FI and 10GBASE-T. LDPC for the needs of reliable and flexible communication links for a wide variety of communication standards and configurations have inspired the demand for high-performance and flexibility computing. Accordingly, finding a fast and reconfigurable developing platform for designing the high-throughput LDPC decoder has become important especially for rapidly changing communication standards and configurations. In this paper, a new graphic-processing-unit (GPU) LDPC decoding platform with the asynchronous data transfer is proposed to realize this practical implementation. Experimental results showed that the proposed GPU-based decoder achieved 271x speedup compared to its CPU-based counterpart. It can serve as a high-throughput LDPC decoder.

Neuroprosthetic Decoder Training as Imitation Learning.

Science.gov (United States)

Merel, Josh; Carlson, David; Paninski, Liam; Cunningham, John P

2016-05-01

Neuroprosthetic brain-computer interfaces function via an algorithm which decodes neural activity of the user into movements of an end effector, such as a cursor or robotic arm. In practice, the decoder is often learned by updating its parameters while the user performs a task. When the user's intention is not directly observable, recent methods have demonstrated value in training the decoder against a surrogate for the user's intended movement. Here we show that training a decoder in this way is a novel variant of an imitation learning problem, where an oracle or expert is employed for supervised training in lieu of direct observations, which are not available. Specifically, we describe how a generic imitation learning meta-algorithm, dataset aggregation (DAgger), can be adapted to train a generic brain-computer interface. By deriving existing learning algorithms for brain-computer interfaces in this framework, we provide a novel analysis of regret (an important metric of learning efficacy) for brain-computer interfaces. This analysis allows us to characterize the space of algorithmic variants and bounds on their regret rates. Existing approaches for decoder learning have been performed in the cursor control setting, but the available design principles for these decoders are such that it has been impossible to scale them to naturalistic settings. Leveraging our findings, we then offer an algorithm that combines imitation learning with optimal control, which should allow for training of arbitrary effectors for which optimal control can generate goal-oriented control. We demonstrate this novel and general BCI algorithm with simulated neuroprosthetic control of a 26 degree-of-freedom model of an arm, a sophisticated and realistic end effector.

Neuroprosthetic Decoder Training as Imitation Learning.

Directory of Open Access Journals (Sweden)

Josh Merel

2016-05-01

Full Text Available Neuroprosthetic brain-computer interfaces function via an algorithm which decodes neural activity of the user into movements of an end effector, such as a cursor or robotic arm. In practice, the decoder is often learned by updating its parameters while the user performs a task. When the user's intention is not directly observable, recent methods have demonstrated value in training the decoder against a surrogate for the user's intended movement. Here we show that training a decoder in this way is a novel variant of an imitation learning problem, where an oracle or expert is employed for supervised training in lieu of direct observations, which are not available. Specifically, we describe how a generic imitation learning meta-algorithm, dataset aggregation (DAgger, can be adapted to train a generic brain-computer interface. By deriving existing learning algorithms for brain-computer interfaces in this framework, we provide a novel analysis of regret (an important metric of learning efficacy for brain-computer interfaces. This analysis allows us to characterize the space of algorithmic variants and bounds on their regret rates. Existing approaches for decoder learning have been performed in the cursor control setting, but the available design principles for these decoders are such that it has been impossible to scale them to naturalistic settings. Leveraging our findings, we then offer an algorithm that combines imitation learning with optimal control, which should allow for training of arbitrary effectors for which optimal control can generate goal-oriented control. We demonstrate this novel and general BCI algorithm with simulated neuroprosthetic control of a 26 degree-of-freedom model of an arm, a sophisticated and realistic end effector.

On Lattice Sequential Decoding for The Unconstrained AWGN Channel

KAUST Repository

Abediseid, Walid; Alouini, Mohamed-Slim

2013-01-01

channel has been studied only under the use of the minimum Euclidean distance decoder that is commonly referred to as the \\textit{lattice decoder}. Lattice decoders based on solutions to the NP-hard closest vector problem are very complex to implement

A ribosome without RNA

Directory of Open Access Journals (Sweden)

Harold S Bernhardt

2015-11-01

Full Text Available It was Francis Crick who first asked why the ribosome contains so much RNA, and discussed the implications of this for the direct flow of genetic information from DNA to protein. Remarkable advances in our understanding of the ribosome and protein synthesis, including the recent publication of two mammalian mitochondrial ribosome structures, have shed new light on this intriguing aspect of evolution in molecular biology. We examine here whether RNA is indispensable for coded protein synthesis, or whether an all-protein ‘ribosome’ (or ‘synthosome’ might be possible, with a protein enzyme catalyzing peptide synthesis, and release factor-like protein adaptors able to read a message composed of deoxyribonucleotides. We also compare the RNA world hypothesis with the alternative ‘proteins first’ hypothesis in terms of their different understandings of the evolution of the ribosome, and whether this might have been preceded by an ancestral form of nonribosomal peptide synthesis catalyzed by protein enzymes.

Singer product apertures—A coded aperture system with a fast decoding algorithm

International Nuclear Information System (INIS)

Byard, Kevin; Shutler, Paul M.E.

2017-01-01

A new type of coded aperture configuration that enables fast decoding of the coded aperture shadowgram data is presented. Based on the products of incidence vectors generated from the Singer difference sets, we call these Singer product apertures. For a range of aperture dimensions, we compare experimentally the performance of three decoding methods: standard decoding, induction decoding and direct vector decoding. In all cases the induction and direct vector methods are several orders of magnitude faster than the standard method, with direct vector decoding being significantly faster than induction decoding. For apertures of the same dimensions the increase in speed offered by direct vector decoding over induction decoding is better for lower throughput apertures.

Singer product apertures—A coded aperture system with a fast decoding algorithm

Energy Technology Data Exchange (ETDEWEB)

Byard, Kevin, E-mail: kevin.byard@aut.ac.nz [School of Economics, Faculty of Business, Economics and Law, Auckland University of Technology, Auckland 1142 (New Zealand); Shutler, Paul M.E. [National Institute of Education, Nanyang Technological University, 1 Nanyang Walk, Singapore 637616 (Singapore)

2017-06-01

A new type of coded aperture configuration that enables fast decoding of the coded aperture shadowgram data is presented. Based on the products of incidence vectors generated from the Singer difference sets, we call these Singer product apertures. For a range of aperture dimensions, we compare experimentally the performance of three decoding methods: standard decoding, induction decoding and direct vector decoding. In all cases the induction and direct vector methods are several orders of magnitude faster than the standard method, with direct vector decoding being significantly faster than induction decoding. For apertures of the same dimensions the increase in speed offered by direct vector decoding over induction decoding is better for lower throughput apertures.

Fast decoding algorithms for coded aperture systems

International Nuclear Information System (INIS)

Byard, Kevin

2014-01-01

Fast decoding algorithms are described for a number of established coded aperture systems. The fast decoding algorithms for all these systems offer significant reductions in the number of calculations required when reconstructing images formed by a coded aperture system and hence require less computation time to produce the images. The algorithms may therefore be of use in applications that require fast image reconstruction, such as near real-time nuclear medicine and location of hazardous radioactive spillage. Experimental tests confirm the efficacy of the fast decoding techniques

The ribosomal protein Rpl22 controls ribosome composition by directly repressing expression of its own paralog, Rpl22l1.

Directory of Open Access Journals (Sweden)

Monique N O'Leary

Full Text Available Most yeast ribosomal protein genes are duplicated and their characterization has led to hypotheses regarding the existence of specialized ribosomes with different subunit composition or specifically-tailored functions. In yeast, ribosomal protein genes are generally duplicated and evidence has emerged that paralogs might have specific roles. Unlike yeast, most mammalian ribosomal proteins are thought to be encoded by a single gene copy, raising the possibility that heterogenous populations of ribosomes are unique to yeast. Here, we examine the roles of the mammalian Rpl22, finding that Rpl22(-/- mice have only subtle phenotypes with no significant translation defects. We find that in the Rpl22(-/- mouse there is a compensatory increase in Rpl22-like1 (Rpl22l1 expression and incorporation into ribosomes. Consistent with the hypothesis that either ribosomal protein can support translation, knockdown of Rpl22l1 impairs growth of cells lacking Rpl22. Mechanistically, Rpl22 regulates Rpl22l1 directly by binding to an internal hairpin structure and repressing its expression. We propose that ribosome specificity may exist in mammals, providing evidence that one ribosomal protein can influence composition of the ribosome by regulating its own paralog.

Synthetic peptides and ribosomal proteins as substrate for 60S ribosomal protein kinase from yeast cells

DEFF Research Database (Denmark)

Grankowski, N; Gasior, E; Issinger, O G

1993-01-01

Kinetic studies on the 60S protein kinase were conducted with synthetic peptides and ribosomal proteins as substrate. Peptide RRREEESDDD proved to be the best synthetic substrate for this enzyme. The peptide has a sequence of amino acids which most closely resembles the structure of potential...... phosphorylation sites in natural substrates, i.e., acidic ribosomal proteins. The superiority of certain kinetic parameters for 60S kinase obtained with the native whole 80S ribosomes over those of the isolated fraction of acidic ribosomal proteins indicates that the affinity of 60S kinase to the specific protein...

Deep Learning Methods for Improved Decoding of Linear Codes

Science.gov (United States)

Nachmani, Eliya; Marciano, Elad; Lugosch, Loren; Gross, Warren J.; Burshtein, David; Be'ery, Yair

2018-02-01

The problem of low complexity, close to optimal, channel decoding of linear codes with short to moderate block length is considered. It is shown that deep learning methods can be used to improve a standard belief propagation decoder, despite the large example space. Similar improvements are obtained for the min-sum algorithm. It is also shown that tying the parameters of the decoders across iterations, so as to form a recurrent neural network architecture, can be implemented with comparable results. The advantage is that significantly less parameters are required. We also introduce a recurrent neural decoder architecture based on the method of successive relaxation. Improvements over standard belief propagation are also observed on sparser Tanner graph representations of the codes. Furthermore, we demonstrate that the neural belief propagation decoder can be used to improve the performance, or alternatively reduce the computational complexity, of a close to optimal decoder of short BCH codes.

Bayesian population decoding of spiking neurons.

Science.gov (United States)

Gerwinn, Sebastian; Macke, Jakob; Bethge, Matthias

2009-01-01

The timing of action potentials in spiking neurons depends on the temporal dynamics of their inputs and contains information about temporal fluctuations in the stimulus. Leaky integrate-and-fire neurons constitute a popular class of encoding models, in which spike times depend directly on the temporal structure of the inputs. However, optimal decoding rules for these models have only been studied explicitly in the noiseless case. Here, we study decoding rules for probabilistic inference of a continuous stimulus from the spike times of a population of leaky integrate-and-fire neurons with threshold noise. We derive three algorithms for approximating the posterior distribution over stimuli as a function of the observed spike trains. In addition to a reconstruction of the stimulus we thus obtain an estimate of the uncertainty as well. Furthermore, we derive a 'spike-by-spike' online decoding scheme that recursively updates the posterior with the arrival of each new spike. We use these decoding rules to reconstruct time-varying stimuli represented by a Gaussian process from spike trains of single neurons as well as neural populations.

Bayesian population decoding of spiking neurons

Directory of Open Access Journals (Sweden)

Sebastian Gerwinn

2009-10-01

Full Text Available The timing of action potentials in spiking neurons depends on the temporal dynamics of their inputs and contains information about temporal fluctuations in the stimulus. Leaky integrate-and-fire neurons constitute a popular class of encoding models, in which spike times depend directly on the temporal structure of the inputs. However, optimal decoding rules for these models have only been studied explicitly in the noiseless case. Here, we study decoding rules for probabilistic inference of a continuous stimulus from the spike times of a population of leaky integrate-and-fire neurons with threshold noise. We derive three algorithms for approximating the posterior distribution over stimuli as a function of the observed spike trains. In addition to a reconstruction of the stimulus we thus obtain an estimate of the uncertainty as well. Furthermore, we derive a `spike-by-spike' online decoding scheme that recursively updates the posterior with the arrival of each new spike. We use these decoding rules to reconstruct time-varying stimuli represented by a Gaussian process from spike trains of single neurons as well as neural populations.

Three phase full wave dc motor decoder

Science.gov (United States)

Studer, P. A. (Inventor)

1977-01-01

A three phase decoder for dc motors is disclosed which employs an extremely simple six transistor circuit to derive six properly phased output signals for fullwave operation of dc motors. Six decoding transistors are coupled at their base-emitter junctions across a resistor network arranged in a delta configuration. Each point of the delta configuration is coupled to one of three position sensors which sense the rotational position of the motor. A second embodiment of the invention is disclosed in which photo-optical isolators are used in place of the decoding transistors.

Decoding and Encoding Facial Expressions in Preschool-Age Children.

Science.gov (United States)

Zuckerman, Miron; Przewuzman, Sylvia J.

1979-01-01

Preschool-age children drew, decoded, and encoded facial expressions depicting five different emotions. Accuracy of drawing, decoding and encoding each of the five emotions was consistent across the three tasks; decoding ability was correlated with drawing ability among female subjects, but neither of these abilities was correlated with encoding…

Highly accurate fluorogenic DNA sequencing with information theory-based error correction.

Science.gov (United States)

Chen, Zitian; Zhou, Wenxiong; Qiao, Shuo; Kang, Li; Duan, Haifeng; Xie, X Sunney; Huang, Yanyi

2017-12-01

Eliminating errors in next-generation DNA sequencing has proved challenging. Here we present error-correction code (ECC) sequencing, a method to greatly improve sequencing accuracy by combining fluorogenic sequencing-by-synthesis (SBS) with an information theory-based error-correction algorithm. ECC embeds redundancy in sequencing reads by creating three orthogonal degenerate sequences, generated by alternate dual-base reactions. This is similar to encoding and decoding strategies that have proved effective in detecting and correcting errors in information communication and storage. We show that, when combined with a fluorogenic SBS chemistry with raw accuracy of 98.1%, ECC sequencing provides single-end, error-free sequences up to 200 bp. ECC approaches should enable accurate identification of extremely rare genomic variations in various applications in biology and medicine.

Codon size reduction as the origin of the triplet genetic code.

Directory of Open Access Journals (Sweden)

Pavel V Baranov

Full Text Available The genetic code appears to be optimized in its robustness to missense errors and frameshift errors. In addition, the genetic code is near-optimal in terms of its ability to carry information in addition to the sequences of encoded proteins. As evolution has no foresight, optimality of the modern genetic code suggests that it evolved from less optimal code variants. The length of codons in the genetic code is also optimal, as three is the minimal nucleotide combination that can encode the twenty standard amino acids. The apparent impossibility of transitions between codon sizes in a discontinuous manner during evolution has resulted in an unbending view that the genetic code was always triplet. Yet, recent experimental evidence on quadruplet decoding, as well as the discovery of organisms with ambiguous and dual decoding, suggest that the possibility of the evolution of triplet decoding from living systems with non-triplet decoding merits reconsideration and further exploration. To explore this possibility we designed a mathematical model of the evolution of primitive digital coding systems which can decode nucleotide sequences into protein sequences. These coding systems can evolve their nucleotide sequences via genetic events of Darwinian evolution, such as point-mutations. The replication rates of such coding systems depend on the accuracy of the generated protein sequences. Computer simulations based on our model show that decoding systems with codons of length greater than three spontaneously evolve into predominantly triplet decoding systems. Our findings suggest a plausible scenario for the evolution of the triplet genetic code in a continuous manner. This scenario suggests an explanation of how protein synthesis could be accomplished by means of long RNA-RNA interactions prior to the emergence of the complex decoding machinery, such as the ribosome, that is required for stabilization and discrimination of otherwise weak triplet codon

Decoding Algorithms for Random Linear Network Codes

DEFF Research Database (Denmark)

Heide, Janus; Pedersen, Morten Videbæk; Fitzek, Frank

2011-01-01

We consider the problem of efficient decoding of a random linear code over a finite field. In particular we are interested in the case where the code is random, relatively sparse, and use the binary finite field as an example. The goal is to decode the data using fewer operations to potentially...... achieve a high coding throughput, and reduce energy consumption.We use an on-the-fly version of the Gauss-Jordan algorithm as a baseline, and provide several simple improvements to reduce the number of operations needed to perform decoding. Our tests show that the improvements can reduce the number...

Structure of Ribosomal Silencing Factor Bound to Mycobacterium tuberculosis Ribosome.

Science.gov (United States)

Li, Xiaojun; Sun, Qingan; Jiang, Cai; Yang, Kailu; Hung, Li-Wei; Zhang, Junjie; Sacchettini, James C

2015-10-06

The ribosomal silencing factor RsfS slows cell growth by inhibiting protein synthesis during periods of diminished nutrient availability. The crystal structure of Mycobacterium tuberculosis (Mtb) RsfS, together with the cryo-electron microscopy (EM) structure of the large subunit 50S of Mtb ribosome, reveals how inhibition of protein synthesis by RsfS occurs. RsfS binds to the 50S at L14, which, when occupied, blocks the association of the small subunit 30S. Although Mtb RsfS is a dimer in solution, only a single subunit binds to 50S. The overlap between the dimer interface and the L14 binding interface confirms that the RsfS dimer must first dissociate to a monomer in order to bind to L14. RsfS interacts primarily through electrostatic and hydrogen bonding to L14. The EM structure shows extended rRNA density that it is not found in the Escherichia coli ribosome, the most striking of these being the extended RNA helix of H54a. Copyright © 2015 Elsevier Ltd. All rights reserved.

Ribosomal studies on the 70S ribosome of E.coli by means of neutron scattering; Strukturuntersuchungen am 70S-Ribosom von E.coli unter Anwendung von Neutronenstreuung

Energy Technology Data Exchange (ETDEWEB)

Burkhardt, N. [GKSS-Forschungszentrum Geesthacht GmbH (Germany). Inst. fuer Werkstofforschung

1997-12-31

Ribosomes are ribonucleo-protein complexes, which catalyse proteinbiosynthesis in all living organisms. Currently, most of the structural models of the prokaryotic 70S ribosome rely on electron microscopy and describe mainly the outer shape of the particle. Neutron scattering can provide information on the internal structure of the ribosome. Parts of the structure can be contrasted for neutrons by means of an isotopic exchange of the naturally occurring hydrogen ({sup 1}H) for deuterium ({sup 2}H), allowing direct measurements in situ. Specifically deuterium-labeled ribosomes (E. coli) were prepared and analysed with neutron scattering. The biochemical methods were established and combined to a generally applicable preparation system. This allows labeling of all ribosomal components in any combination. A systematic analysis of the protein and RNA phases resulted in the development of a new model for the 70S ribosome. This model describes not only the outer shape of the particle, but displays also an experimentally determined internal protein-RNA distribution and the border of subunits for the first time (four-phase model; resolution: 50A). Models of the 70S ribosome from other studies were evaluated and ranked according to consistency with the measured scattering data. Applying a new neutron scattering technique of particular sensitivity, the proton-spin contrast-variation, single proteins could be measured and localized. The positions of the proteins S6 and S10 were determined, providing the first coordinates of protein mass centers within the 70S ribosome. (orig.) [Deutsch] Ribosomen sind Ribonukleinsaeure-Protein Komplexe, die in allen lebenden Organismen die Proteinbiosynthese katalysieren. Strukturmodelle fuer das prokaryontische 70S-Ribosom beruhen derzeit vorwiegend auf elektronenmikroskopischen Untersuchungen und beschreiben im wesentlichen die aeussere Oberflaeche des Partikels. Informationen ueber die innere Struktur des Ribosoms koennen Messungen mit

Ribosomal studies on the 70S ribosome of E.coli by means of neutron scattering; Strukturuntersuchungen am 70S-Ribosom von E.coli unter Anwendung von Neutronenstreuung

Energy Technology Data Exchange (ETDEWEB)

Burkhardt, N [GKSS-Forschungszentrum Geesthacht GmbH (Germany). Inst. fuer Werkstofforschung

1998-12-31

Ribosomes are ribonucleo-protein complexes, which catalyse proteinbiosynthesis in all living organisms. Currently, most of the structural models of the prokaryotic 70S ribosome rely on electron microscopy and describe mainly the outer shape of the particle. Neutron scattering can provide information on the internal structure of the ribosome. Parts of the structure can be contrasted for neutrons by means of an isotopic exchange of the naturally occurring hydrogen ({sup 1}H) for deuterium ({sup 2}H), allowing direct measurements in situ. Specifically deuterium-labeled ribosomes (E. coli) were prepared and analysed with neutron scattering. The biochemical methods were established and combined to a generally applicable preparation system. This allows labeling of all ribosomal components in any combination. A systematic analysis of the protein and RNA phases resulted in the development of a new model for the 70S ribosome. This model describes not only the outer shape of the particle, but displays also an experimentally determined internal protein-RNA distribution and the border of subunits for the first time (four-phase model; resolution: 50A). Models of the 70S ribosome from other studies were evaluated and ranked according to consistency with the measured scattering data. Applying a new neutron scattering technique of particular sensitivity, the proton-spin contrast-variation, single proteins could be measured and localized. The positions of the proteins S6 and S10 were determined, providing the first coordinates of protein mass centers within the 70S ribosome. (orig.) [Deutsch] Ribosomen sind Ribonukleinsaeure-Protein Komplexe, die in allen lebenden Organismen die Proteinbiosynthese katalysieren. Strukturmodelle fuer das prokaryontische 70S-Ribosom beruhen derzeit vorwiegend auf elektronenmikroskopischen Untersuchungen und beschreiben im wesentlichen die aeussere Oberflaeche des Partikels. Informationen ueber die innere Struktur des Ribosoms koennen Messungen mit

Oppositional Decoding as an Act of Resistance.

Science.gov (United States)

Steiner, Linda

1988-01-01

Argues that contributors to the "No Comment" feature of "Ms." magazine are engaging in oppositional decoding and speculates on why this is a satisfying group process. Also notes such decoding presents another challenge to the idea that mass media has the same effect on all audiences. (SD)

Differential Stoichiometry among Core Ribosomal Proteins

Directory of Open Access Journals (Sweden)

Nikolai Slavov

2015-11-01

Full Text Available Understanding the regulation and structure of ribosomes is essential to understanding protein synthesis and its dysregulation in disease. While ribosomes are believed to have a fixed stoichiometry among their core ribosomal proteins (RPs, some experiments suggest a more variable composition. Testing such variability requires direct and precise quantification of RPs. We used mass spectrometry to directly quantify RPs across monosomes and polysomes of mouse embryonic stem cells (ESC and budding yeast. Our data show that the stoichiometry among core RPs in wild-type yeast cells and ESC depends both on the growth conditions and on the number of ribosomes bound per mRNA. Furthermore, we find that the fitness of cells with a deleted RP-gene is inversely proportional to the enrichment of the corresponding RP in polysomes. Together, our findings support the existence of ribosomes with distinct protein composition and physiological function.

Iterative Sparse Channel Estimation and Decoding for Underwater MIMO-OFDM

Directory of Open Access Journals (Sweden)

Berger ChristianR

2010-01-01

Full Text Available We propose a block-by-block iterative receiver for underwater MIMO-OFDM that couples channel estimation with multiple-input multiple-output (MIMO detection and low-density parity-check (LDPC channel decoding. In particular, the channel estimator is based on a compressive sensing technique to exploit the channel sparsity, the MIMO detector consists of a hybrid use of successive interference cancellation and soft minimum mean-square error (MMSE equalization, and channel coding uses nonbinary LDPC codes. Various feedback strategies from the channel decoder to the channel estimator are studied, including full feedback of hard or soft symbol decisions, as well as their threshold-controlled versions. We study the receiver performance using numerical simulation and experimental data collected from the RACE08 and SPACE08 experiments. We find that iterative receiver processing including sparse channel estimation leads to impressive performance gains. These gains are more pronounced when the number of available pilots to estimate the channel is decreased, for example, when a fixed number of pilots is split between an increasing number of parallel data streams in MIMO transmission. For the various feedback strategies for iterative channel estimation, we observe that soft decision feedback slightly outperforms hard decision feedback.

Iterative Decoding for an Optical CDMA based Laser communication System

International Nuclear Information System (INIS)

Kim, Jin Young; Kim, Eun Cheol; Cha, Jae Sang

2008-01-01

An optical CDMA(code division multiple access)based Laser communication system has attracted much attention since it requires minimal optical Laser signal processing and it is virtually delay free, while from the theoretical point of view, its performance depends on the auto and cross correlation properties of employed sequences. Various kinds of channel coding schemes for optical CDMA based Laser communication systems have been proposed and analyzed to compensate nonideal channel and receiver conditions in impaired photon channels. In this paper, we propose and analyze an iterative decoding of optical CDMA based Laser communication signals for both shot noise limited and thermal noise limited systems. It is assumed that optical channel is an intensity modulated (IM)channel and direct detection scheme is employed to detect the received optical signal. The performance is evaluated in terms of bit error probability and throughput. It is demonstrated that the BER and throughput performance is substantially improved with interleaver length for a fixed code rate and with alphabet size of PPM (pulse position modulation). Also, the BER and throughput performance is significantly enhanced with the number of iterations for decoding process. The results in this paper can be applied to the optical CDMA based Laser communication network with multiple access applications

Iterative Decoding for an Optical CDMA based Laser communication System

Energy Technology Data Exchange (ETDEWEB)

Kim, Jin Young; Kim, Eun Cheol [Kwangwoon Univ., Seoul (Korea, Republic of); Cha, Jae Sang [Seoul National Univ. of Technology, Seoul (Korea, Republic of)

2008-11-15

An optical CDMA(code division multiple access)based Laser communication system has attracted much attention since it requires minimal optical Laser signal processing and it is virtually delay free, while from the theoretical point of view, its performance depends on the auto and cross correlation properties of employed sequences. Various kinds of channel coding schemes for optical CDMA based Laser communication systems have been proposed and analyzed to compensate nonideal channel and receiver conditions in impaired photon channels. In this paper, we propose and analyze an iterative decoding of optical CDMA based Laser communication signals for both shot noise limited and thermal noise limited systems. It is assumed that optical channel is an intensity modulated (IM)channel and direct detection scheme is employed to detect the received optical signal. The performance is evaluated in terms of bit error probability and throughput. It is demonstrated that the BER and throughput performance is substantially improved with interleaver length for a fixed code rate and with alphabet size of PPM (pulse position modulation). Also, the BER and throughput performance is significantly enhanced with the number of iterations for decoding process. The results in this paper can be applied to the optical CDMA based Laser communication network with multiple access applications.

Control of ribosome formation in rat heart

International Nuclear Information System (INIS)

Russo, L.A.

1987-01-01

Diabetes of 9 days duration produced a 17% diminution in the rate of total protein synthesis in rat hearts perfused as Langendorff preparations supplied with glucose, plasma levels of amino acids, and 400 μU/ml insulin. This reduction was attributable to a decrease in efficiency of protein synthesis and total RNA content. Total messenger RNA content decreased in diabetic hearts in proportion to the reduction in total RNA. Diabetes also resulted in diminished ribosome content as reflected by the induction in total RNA. Ribosome production was investigated by monitoring incorporation of [ 3 H]phenylalanine into the proteins of cytoplasmic ribosomes. Rates of ribosome formation in diabetic hearts were as fast as control rates in the presence of insulin, and were faster than control rates in the absence of the hormone. These results indicated that ribosome content fell in diabetic hearts despite unchanged or faster rates of ribosome formation

Error Correction for Non-Abelian Topological Quantum Computation

Directory of Open Access Journals (Sweden)

James R. Wootton

2014-03-01

Full Text Available The possibility of quantum computation using non-Abelian anyons has been considered for over a decade. However, the question of how to obtain and process information about what errors have occurred in order to negate their effects has not yet been considered. This is in stark contrast with quantum computation proposals for Abelian anyons, for which decoding algorithms have been tailor-made for many topological error-correcting codes and error models. Here, we address this issue by considering the properties of non-Abelian error correction, in general. We also choose a specific anyon model and error model to probe the problem in more detail. The anyon model is the charge submodel of D(S_{3}. This shares many properties with important models such as the Fibonacci anyons, making our method more generally applicable. The error model is a straightforward generalization of those used in the case of Abelian anyons for initial benchmarking of error correction methods. It is found that error correction is possible under a threshold value of 7% for the total probability of an error on each physical spin. This is remarkably comparable with the thresholds for Abelian models.

Cryo-EM structure of the archaeal 50S ribosomal subunit in complex with initiation factor 6 and implications for ribosome evolution

DEFF Research Database (Denmark)

Greber, Basil J; Boehringer, Daniel; Godinic-Mikulcic, Vlatka

2012-01-01

additional components of the translation machinery with eukaryotes that are absent in bacteria. One of these translation factors is initiation factor 6 (IF6), which associates with the large ribosomal subunit. We have reconstructed the 50S ribosomal subunit from the archaeon Methanothermobacter...... between this archaeal ribosome and eukaryotic ribosomes but are mostly absent in bacteria and in some archaeal lineages. Furthermore, the structure reveals that, in spite of highly divergent evolutionary trajectories of the ribosomal particle and the acquisition of novel functions of IF6 in eukaryotes......, the molecular binding of IF6 on the ribosome is conserved between eukaryotes and archaea. The structure also provides a snapshot of the reductive evolution of the archaeal ribosome and offers new insights into the evolution of the translation system in archaea....

Joint Carrier-Phase Synchronization and LDPC Decoding

Science.gov (United States)

Simon, Marvin; Valles, Esteban

2009-01-01

A method has been proposed to increase the degree of synchronization of a radio receiver with the phase of a suppressed carrier signal modulated with a binary- phase-shift-keying (BPSK) or quaternary- phase-shift-keying (QPSK) signal representing a low-density parity-check (LDPC) code. This method is an extended version of the method described in Using LDPC Code Constraints to Aid Recovery of Symbol Timing (NPO-43112), NASA Tech Briefs, Vol. 32, No. 10 (October 2008), page 54. Both methods and the receiver architectures in which they would be implemented belong to a class of timing- recovery methods and corresponding receiver architectures characterized as pilotless in that they do not require transmission and reception of pilot signals. The proposed method calls for the use of what is known in the art as soft decision feedback to remove the modulation from a replica of the incoming signal prior to feeding this replica to a phase-locked loop (PLL) or other carrier-tracking stage in the receiver. Soft decision feedback refers to suitably processed versions of intermediate results of iterative computations involved in the LDPC decoding process. Unlike a related prior method in which hard decision feedback (the final sequence of decoded symbols) is used to remove the modulation, the proposed method does not require estimation of the decoder error probability. In a basic digital implementation of the proposed method, the incoming signal (having carrier phase theta theta (sub c) plus noise would first be converted to inphase (I) and quadrature (Q) baseband signals by mixing it with I and Q signals at the carrier frequency [wc/(2 pi)] generated by a local oscillator. The resulting demodulated signals would be processed through one-symbol-period integrate and- dump filters, the outputs of which would be sampled and held, then multiplied by a soft-decision version of the baseband modulated signal. The resulting I and Q products consist of terms proportional to the cosine

Kinetic pathway of 40S ribosomal subunit recruitment to hepatitis C virus internal ribosome entry site.

Science.gov (United States)

Fuchs, Gabriele; Petrov, Alexey N; Marceau, Caleb D; Popov, Lauren M; Chen, Jin; O'Leary, Seán E; Wang, Richard; Carette, Jan E; Sarnow, Peter; Puglisi, Joseph D

2015-01-13

Translation initiation can occur by multiple pathways. To delineate these pathways by single-molecule methods, fluorescently labeled ribosomal subunits are required. Here, we labeled human 40S ribosomal subunits with a fluorescent SNAP-tag at ribosomal protein eS25 (RPS25). The resulting ribosomal subunits could be specifically labeled in living cells and in vitro. Using single-molecule Förster resonance energy transfer (FRET) between RPS25 and domain II of the hepatitis C virus (HCV) internal ribosome entry site (IRES), we measured the rates of 40S subunit arrival to the HCV IRES. Our data support a single-step model of HCV IRES recruitment to 40S subunits, irreversible on the initiation time scale. We furthermore demonstrated that after binding, the 40S:HCV IRES complex is conformationally dynamic, undergoing slow large-scale rearrangements. Addition of translation extracts suppresses these fluctuations, funneling the complex into a single conformation on the 80S assembly pathway. These findings show that 40S:HCV IRES complex formation is accompanied by dynamic conformational rearrangements that may be modulated by initiation factors.

Crystallization of ribosomes from Thermus thermophilus

International Nuclear Information System (INIS)

Karpova, E.A.; Serdyuk, I.N.; Tarkhovskii, Yu.S.; Orlova, E.V.; Borovyagin, V.L.

1987-01-01

An understanding of the molecular bases of the process of protein biosynthesis on the ribosome requires a knowledge of its structure with high three-dimensional resolution involving the method of x-ray crystallographic analysis. The authors report on the production of crystals of the 70S ribosomes from a new source - the highly thermophilic bacterium Thermus thermophilus. Ribosomes for crystallization were obtained from Th. thermophilus strain HB8 by two washings in buffer with high ionic strength. The ribosome preparation was investigated for homogeneity by the method of high-speed sedimentation in a buffer containing 15 mM MgCl 2 , 50 mM NH 4 Cl, and 10 MM Tris-HCl, pH 7.5. Analysis showed that the preparation if homogeneous. The same preparation was investigated for intactness of ribosomal RNA by the method of gel electrophoresis in 2.75% acrylamide 0.5% agarose gel in a buffer containing 30 mM Tris, 30 mM NaH 2 PO 4 , 10 mM EDTA, 1-2% SDS, and 6 M urea. Analysis showed that the preparation possesses intact 16S and 23S RNA. The latter did not degrade, at least in a week of exposure of the ribosomes in buffer solution at 5 0 C. The ribosome preparation had no appreciable RNase activity, which was verified by incubating 4.5 micrograms of ribosomes with 3 micrograms of 14 C-labeled 16S rRna (50 0 C, 90 min) in a buffer containing 10 mM MgCl 2 , 100 mM NH 4 Cl, and 10 mM Tris-HCl, pH/sub 20 0 / 7.5. The incubated nonhydrolyzed RNA was precipitated with 5% trichloroacetic acid and applied on a GF/C filter. The radioactivity was determined in a toluene scintillator on an LS-100C counter

Cryo-EM Structure of the Archaeal 50S Ribosomal Subunit in Complex with Initiation Factor 6 and Implications for Ribosome Evolution

Science.gov (United States)

Greber, Basil J.; Boehringer, Daniel; Godinic-Mikulcic, Vlatka; Crnkovic, Ana; Ibba, Michael; Weygand-Durasevic, Ivana; Ban, Nenad

2013-01-01

Translation of mRNA into proteins by the ribosome is universally conserved in all cellular life. The composition and complexity of the translation machinery differ markedly between the three domains of life. Organisms from the domain Archaea show an intermediate level of complexity, sharing several additional components of the translation machinery with eukaryotes that are absent in bacteria. One of these translation factors is initiation factor 6 (IF6), which associates with the large ribosomal subunit. We have reconstructed the 50S ribosomal subunit from the archaeon Methanothermobacter thermautotrophicus in complex with archaeal IF6 at 6.6 Å resolution using cryo-electron microscopy (EM). The structure provides detailed architectural insights into the 50S ribosomal subunit from a methanogenic archaeon through identification of the rRNA expansion segments and ribosomal proteins that are shared between this archaeal ribosome and eukaryotic ribosomes but are mostly absent in bacteria and in some archaeal lineages. Furthermore, the structure reveals that, in spite of highly divergent evolutionary trajectories of the ribosomal particle and the acquisition of novel functions of IF6 in eukaryotes, the molecular binding of IF6 on the ribosome is conserved between eukaryotes and archaea. The structure also provides a snapshot of the reductive evolution of the archaeal ribosome and offers new insights into the evolution of the translation system in archaea. PMID:22306461

Locally decodable codes and private information retrieval schemes

CERN Document Server

Yekhanin, Sergey

2010-01-01

Locally decodable codes (LDCs) are codes that simultaneously provide efficient random access retrieval and high noise resilience by allowing reliable reconstruction of an arbitrary bit of a message by looking at only a small number of randomly chosen codeword bits. Local decodability comes with a certain loss in terms of efficiency - specifically, locally decodable codes require longer codeword lengths than their classical counterparts. Private information retrieval (PIR) schemes are cryptographic protocols designed to safeguard the privacy of database users. They allow clients to retrieve rec

Turbo decoder architecture for beyond-4G applications

CERN Document Server

Wong, Cheng-Chi

2013-01-01

This book describes the most recent techniques for turbo decoder implementation, especially for 4G and beyond 4G applications. The authors reveal techniques for the design of high-throughput decoders for future telecommunication systems, enabling designers to reduce hardware cost and shorten processing time. Coverage includes an explanation of VLSI implementation of the turbo decoder, from basic functional units to advanced parallel architecture. The authors discuss both hardware architecture techniques and experimental results, showing the variations in area/throughput/performance with respec

Mapping visual stimuli to perceptual decisions via sparse decoding of mesoscopic neural activity.

Science.gov (United States)

Sajda, Paul

2010-01-01

In this talk I will describe our work investigating sparse decoding of neural activity, given a realistic mapping of the visual scene to neuronal spike trains generated by a model of primary visual cortex (V1). We use a linear decoder which imposes sparsity via an L1 norm. The decoder can be viewed as a decoding neuron (linear summation followed by a sigmoidal nonlinearity) in which there are relatively few non-zero synaptic weights. We find: (1) the best decoding performance is for a representation that is sparse in both space and time, (2) decoding of a temporal code results in better performance than a rate code and is also a better fit to the psychophysical data, (3) the number of neurons required for decoding increases monotonically as signal-to-noise in the stimulus decreases, with as little as 1% of the neurons required for decoding at the highest signal-to-noise levels, and (4) sparse decoding results in a more accurate decoding of the stimulus and is a better fit to psychophysical performance than a distributed decoding, for example one imposed by an L2 norm. We conclude that sparse coding is well-justified from a decoding perspective in that it results in a minimum number of neurons and maximum accuracy when sparse representations can be decoded from the neural dynamics.

Error Characterization and Mitigation for 16Nm MLC NAND Flash Memory Under Total Ionizing Dose Effect

Science.gov (United States)

Li, Yue (Inventor); Bruck, Jehoshua (Inventor)

2018-01-01

A data device includes a memory having a plurality of memory cells configured to store data values in accordance with a predetermined rank modulation scheme that is optional and a memory controller that receives a current error count from an error decoder of the data device for one or more data operations of the flash memory device and selects an operating mode for data scrubbing in accordance with the received error count and a program cycles count.

An investigation of error correcting techniques for OMV and AXAF

Science.gov (United States)

Ingels, Frank; Fryer, John

1991-01-01

The original objectives of this project were to build a test system for the NASA 255/223 Reed/Solomon encoding/decoding chip set and circuit board. This test system was then to be interfaced with a convolutional system at MSFC to examine the performance of the concantinated codes. After considerable work, it was discovered that the convolutional system could not function as needed. This report documents the design, construction, and testing of the test apparatus for the R/S chip set. The approach taken was to verify the error correcting behavior of the chip set by injecting known error patterns onto data and observing the results. Error sequences were generated using pseudo-random number generator programs, with Poisson time distribution between errors and Gaussian burst lengths. Sample means, variances, and number of un-correctable errors were calculated for each data set before testing.

Fault-tolerant quantum computing in the Pauli or Clifford frame with slow error diagnostics

Directory of Open Access Journals (Sweden)

Christopher Chamberland

2018-01-01

Full Text Available We consider the problem of fault-tolerant quantum computation in the presence of slow error diagnostics, either caused by measurement latencies or slow decoding algorithms. Our scheme offers a few improvements over previously existing solutions, for instance it does not require active error correction and results in a reduced error-correction overhead when error diagnostics is much slower than the gate time. In addition, we adapt our protocol to cases where the underlying error correction strategy chooses the optimal correction amongst all Clifford gates instead of the usual Pauli gates. The resulting Clifford frame protocol is of independent interest as it can increase error thresholds and could find applications in other areas of quantum computation.

Observing human movements helps decoding environmental forces.

Science.gov (United States)

Zago, Myrka; La Scaleia, Barbara; Miller, William L; Lacquaniti, Francesco

2011-11-01

Vision of human actions can affect several features of visual motion processing, as well as the motor responses of the observer. Here, we tested the hypothesis that action observation helps decoding environmental forces during the interception of a decelerating target within a brief time window, a task intrinsically very difficult. We employed a factorial design to evaluate the effects of scene orientation (normal or inverted) and target gravity (normal or inverted). Button-press triggered the motion of a bullet, a piston, or a human arm. We found that the timing errors were smaller for upright scenes irrespective of gravity direction in the Bullet group, while the errors were smaller for the standard condition of normal scene and gravity in the Piston group. In the Arm group, instead, performance was better when the directions of scene and target gravity were concordant, irrespective of whether both were upright or inverted. These results suggest that the default viewer-centered reference frame is used with inanimate scenes, such as those of the Bullet and Piston protocols. Instead, the presence of biological movements in animate scenes (as in the Arm protocol) may help processing target kinematics under the ecological conditions of coherence between scene and target gravity directions.

The Differential Contributions of Auditory-Verbal and Visuospatial Working Memory on Decoding Skills in Children Who Are Poor Decoders

Science.gov (United States)

Squires, Katie Ellen

2013-01-01

This study investigated the differential contribution of auditory-verbal and visuospatial working memory (WM) on decoding skills in second- and fifth-grade children identified with poor decoding. Thirty-two second-grade students and 22 fifth-grade students completed measures that assessed simple and complex auditory-verbal and visuospatial memory,…

Decoding using back-project algorithm from coded image in ICF

International Nuclear Information System (INIS)

Jiang shaoen; Liu Zhongli; Zheng Zhijian; Tang Daoyuan

1999-01-01

The principle of the coded imaging and its decoding in inertial confinement fusion is described simply. The authors take ring aperture microscope for example and use back-project (BP) algorithm to decode the coded image. The decoding program has been performed for numerical simulation. Simulations of two models are made, and the results show that the accuracy of BP algorithm is high and effect of reconstruction is good. Thus, it indicates that BP algorithm is applicable to decoding for coded image in ICF experiments

A real-time MPEG software decoder using a portable message-passing library

Energy Technology Data Exchange (ETDEWEB)

Kwong, Man Kam; Tang, P.T. Peter; Lin, Biquan

1995-12-31

We present a real-time MPEG software decoder that uses message-passing libraries such as MPL, p4 and MPI. The parallel MPEG decoder currently runs on the IBM SP system but can be easil ported to other parallel machines. This paper discusses our parallel MPEG decoding algorithm as well as the parallel programming environment under which it uses. Several technical issues are discussed, including balancing of decoding speed, memory limitation, 1/0 capacities, and optimization of MPEG decoding components. This project shows that a real-time portable software MPEG decoder is feasible in a general-purpose parallel machine.

Efficient universal computing architectures for decoding neural activity.

Directory of Open Access Journals (Sweden)

Benjamin I Rapoport

Full Text Available The ability to decode neural activity into meaningful control signals for prosthetic devices is critical to the development of clinically useful brain- machine interfaces (BMIs. Such systems require input from tens to hundreds of brain-implanted recording electrodes in order to deliver robust and accurate performance; in serving that primary function they should also minimize power dissipation in order to avoid damaging neural tissue; and they should transmit data wirelessly in order to minimize the risk of infection associated with chronic, transcutaneous implants. Electronic architectures for brain- machine interfaces must therefore minimize size and power consumption, while maximizing the ability to compress data to be transmitted over limited-bandwidth wireless channels. Here we present a system of extremely low computational complexity, designed for real-time decoding of neural signals, and suited for highly scalable implantable systems. Our programmable architecture is an explicit implementation of a universal computing machine emulating the dynamics of a network of integrate-and-fire neurons; it requires no arithmetic operations except for counting, and decodes neural signals using only computationally inexpensive logic operations. The simplicity of this architecture does not compromise its ability to compress raw neural data by factors greater than [Formula: see text]. We describe a set of decoding algorithms based on this computational architecture, one designed to operate within an implanted system, minimizing its power consumption and data transmission bandwidth; and a complementary set of algorithms for learning, programming the decoder, and postprocessing the decoded output, designed to operate in an external, nonimplanted unit. The implementation of the implantable portion is estimated to require fewer than 5000 operations per second. A proof-of-concept, 32-channel field-programmable gate array (FPGA implementation of this portion

Ribosomal history reveals origins of modern protein synthesis.

Directory of Open Access Journals (Sweden)

Ajith Harish

Full Text Available The origin and evolution of the ribosome is central to our understanding of the cellular world. Most hypotheses posit that the ribosome originated in the peptidyl transferase center of the large ribosomal subunit. However, these proposals do not link protein synthesis to RNA recognition and do not use a phylogenetic comparative framework to study ribosomal evolution. Here we infer evolution of the structural components of the ribosome. Phylogenetic methods widely used in morphometrics are applied directly to RNA structures of thousands of molecules and to a census of protein structures in hundreds of genomes. We find that components of the small subunit involved in ribosomal processivity evolved earlier than the catalytic peptidyl transferase center responsible for protein synthesis. Remarkably, subunit RNA and proteins coevolved, starting with interactions between the oldest proteins (S12 and S17 and the oldest substructure (the ribosomal ratchet in the small subunit and ending with the rise of a modern multi-subunit ribosome. Ancestral ribonucleoprotein components show similarities to in vitro evolved RNA replicase ribozymes and protein structures in extant replication machinery. Our study therefore provides important clues about the chicken-or-egg dilemma associated with the central dogma of molecular biology by showing that ribosomal history is driven by the gradual structural accretion of protein and RNA structures. Most importantly, results suggest that functionally important and conserved regions of the ribosome were recruited and could be relics of an ancient ribonucleoprotein world.

Word Processing in Dyslexics: An Automatic Decoding Deficit?

Science.gov (United States)

Yap, Regina; Van Der Leu, Aryan

1993-01-01

Compares dyslexic children with normal readers on measures of phonological decoding and automatic word processing. Finds that dyslexics have a deficit in automatic phonological decoding skills. Discusses results within the framework of the phonological deficit and the automatization deficit hypotheses. (RS)

Post-transcriptional regulation of ribosome biogenesis in yeast

Directory of Open Access Journals (Sweden)

Isabelle C. Kos-Braun

2017-05-01

Full Text Available Most microorganisms are exposed to the constantly and often rapidly changing environment. As such they evolved mechanisms to balance their metabolism and energy expenditure with the resources available to them. When resources become scarce or conditions turn out to be unfavourable for growth, cells reduce their metabolism and energy usage to survive. One of the major energy consuming processes in the cell is ribosome biogenesis. Unsurprisingly, cells encountering adverse conditions immediately shut down production of new ribosomes. It is well established that nutrient depletion leads to a rapid repression of transcription of the genes encoding ribosomal proteins, ribosome biogenesis factors as well as ribosomal RNA (rRNA. However, if pre-rRNA processing and ribosome assembly are regulated post-transcriptionally remains largely unclear. We have recently uncovered that the yeast Saccharomyces cerevisiae rapidly switches between two alternative pre-rRNA processing pathways depending on the environmental conditions. Our findings reveal a new level of complexity in the regulation of ribosome biogenesis.

Ribosomal Antibiotics: Contemporary Challenges

Directory of Open Access Journals (Sweden)

Tamar Auerbach-Nevo

2016-06-01

Full Text Available Most ribosomal antibiotics obstruct distinct ribosomal functions. In selected cases, in addition to paralyzing vital ribosomal tasks, some ribosomal antibiotics are involved in cellular regulation. Owing to the global rapid increase in the appearance of multi-drug resistance in pathogenic bacterial strains, and to the extremely slow progress in developing new antibiotics worldwide, it seems that, in addition to the traditional attempts at improving current antibiotics and the intensive screening for additional natural compounds, this field should undergo substantial conceptual revision. Here, we highlight several contemporary issues, including challenging the common preference of broad-range antibiotics; the marginal attention to alterations in the microbiome population resulting from antibiotics usage, and the insufficient awareness of ecological and environmental aspects of antibiotics usage. We also highlight recent advances in the identification of species-specific structural motifs that may be exploited for the design and the creation of novel, environmental friendly, degradable, antibiotic types, with a better distinction between pathogens and useful bacterial species in the microbiome. Thus, these studies are leading towards the design of “pathogen-specific antibiotics,” in contrast to the current preference of broad range antibiotics, partially because it requires significant efforts in speeding up the discovery of the unique species motifs as well as the clinical pathogen identification.

Effect of primary and secondary radicals on chain breaks in ribosomal RNA in E. coli ribosomes

International Nuclear Information System (INIS)

Singh, H.; Bishop, J.

1984-01-01

It has been shown previously that, in dilute aerated solutions, ribosomes are inactivated by OH radicals and by secondary radicals produced from added alcohols (Singh and Vadasz 1983 a). In de-aerated solutions, both radicalH and e - sub(aq) also inactivate ribosomes (Singh and Vadasz 1983 b). The results of these studies and other on different systems (Adams et al. 1973, Aldrich and Cundall 1969, Dewey and Stein 1970, Masuda et al. 1971, Nabben et al. 1982, 1983, Samuni et al. 1980, Singh and Singh 1982) have shown that damage to biological systems occurs by diverse mechanisms. One of these mechanisms involves chain breaks in RNA (Pollard and Weller 1967). The purpose of this study was to determine which of the primary and secondary radicals cause chain breaks in ribosomal RNA (rRNA) within the ribosomes. (author)

Construction and decoding of matrix-product codes from nested codes

DEFF Research Database (Denmark)

Hernando, Fernando; Lally, Kristine; Ruano, Diego

2009-01-01

We consider matrix-product codes [C1 ... Cs] · A, where C1, ..., Cs  are nested linear codes and matrix A has full rank. We compute their minimum distance and provide a decoding algorithm when A is a non-singular by columns matrix. The decoding algorithm decodes up to half of the minimum distance....

Design of FBG En/decoders in Coherent 2-D Time-polarization OCDMA Systems

Science.gov (United States)

Hou, Fen-fei; Yang, Ming

2012-12-01

A novel fiber Bragg grating (FBG)-based en/decoder for the two-dimensional (2-D) time-spreading and polarization multiplexer optical coding is proposed. Compared with other 2-D en/decoders, the proposed en/decoding for an optical code-division multiple-access (OCDMA) system uses a single phase-encoded FBG and coherent en/decoding. Furthermore, combined with reconstruction-equivalent-chirp technology, such en/decoders can be realized with a conventional simple fabrication setup. Experimental results of such en/decoders and the corresponding system test at a data rate of 5 Gbit/s demonstrate that this kind of 2-D FBG-based en/decoders could improve the performances of OCDMA systems.

Decoding bipedal locomotion from the rat sensorimotor cortex

NARCIS (Netherlands)

Rigosa, J.; Panarese, A.; Dominici, N.; Friedli, L.; van den Brand, R.; Carpaneto, J.; DiGiovanna, J.; Courtine, G.; Micera, S.

2015-01-01

Objective. Decoding forelimb movements from the firing activity of cortical neurons has been interfaced with robotic and prosthetic systems to replace lost upper limb functions in humans. Despite the potential of this approach to improve locomotion and facilitate gait rehabilitation, decoding lower

Performance-complexity tradeoff in sequential decoding for the unconstrained AWGN channel

KAUST Repository

Abediseid, Walid; Alouini, Mohamed-Slim

2013-01-01

channel has been studied only under the use of the minimum Euclidean distance decoder that is commonly referred to as the lattice decoder. Lattice decoders based on solutions to the NP-hard closest vector problem are very complex to implement

Placeholder factors in ribosome biogenesis: please, pave my way

Directory of Open Access Journals (Sweden)

Francisco J. Espinar-Marchena

2017-04-01

Full Text Available The synthesis of cytoplasmic eukaryotic ribosomes is an extraordinarily energy-demanding cellular activity that occurs progressively from the nucleolus to the cytoplasm. In the nucleolus, precursor rRNAs associate with a myriad of trans-acting factors and some ribosomal proteins to form pre-ribosomal particles. These factors include snoRNPs, nucleases, ATPases, GTPases, RNA helicases, and a vast list of proteins with no predicted enzymatic activity. Their coordinate activity orchestrates in a spatiotemporal manner the modification and processing of precursor rRNAs, the rearrangement reactions required for the formation of productive RNA folding intermediates, the ordered assembly of the ribosomal proteins, and the export of pre-ribosomal particles to the cytoplasm; thus, providing speed, directionality and accuracy to the overall process of formation of translation-competent ribosomes. Here, we review a particular class of trans-acting factors known as “placeholders”. Placeholder factors temporarily bind selected ribosomal sites until these have achieved a structural context that is appropriate for exchanging the placeholder with another site-specific binding factor. By this strategy, placeholders sterically prevent premature recruitment of subsequently binding factors, premature formation of structures, avoid possible folding traps, and act as molecular clocks that supervise the correct progression of pre-ribosomal particles into functional ribosomal subunits. We summarize the current understanding of those factors that delay the assembly of distinct ribosomal proteins or subsequently bind key sites in pre-ribosomal particles. We also discuss recurrent examples of RNA-protein and protein-protein mimicry between rRNAs and/or factors, which have clear functional implications for the ribosome biogenesis pathway.

Error-rate performance analysis of incremental decode-and-forward opportunistic relaying

KAUST Repository

Tourki, Kamel; Yang, Hongchuan; Alouini, Mohamed-Slim

2011-01-01

In this paper, we investigate an incremental opportunistic relaying scheme where the selected relay chooses to cooperate only if the source-destination channel is of an unacceptable quality. In our study, we consider regenerative relaying in which the decision to cooperate is based on a signal-to-noise ratio (SNR) threshold and takes into account the effect of the possible erroneously detected and transmitted data at the best relay. We derive a closed-form expression for the end-to-end bit-error rate (BER) of binary phase-shift keying (BPSK) modulation based on the exact probability density function (PDF) of each hop. Furthermore, we evaluate the asymptotic error performance and the diversity order is deduced. We show that performance simulation results coincide with our analytical results. © 2011 IEEE.

Error-rate performance analysis of incremental decode-and-forward opportunistic relaying

KAUST Repository

Tourki, Kamel

2011-06-01

In this paper, we investigate an incremental opportunistic relaying scheme where the selected relay chooses to cooperate only if the source-destination channel is of an unacceptable quality. In our study, we consider regenerative relaying in which the decision to cooperate is based on a signal-to-noise ratio (SNR) threshold and takes into account the effect of the possible erroneously detected and transmitted data at the best relay. We derive a closed-form expression for the end-to-end bit-error rate (BER) of binary phase-shift keying (BPSK) modulation based on the exact probability density function (PDF) of each hop. Furthermore, we evaluate the asymptotic error performance and the diversity order is deduced. We show that performance simulation results coincide with our analytical results. © 2011 IEEE.

Percolation bounds for decoding thresholds with correlated erasures in quantum LDPC codes

Science.gov (United States)

Hamilton, Kathleen; Pryadko, Leonid

Correlations between errors can dramatically affect decoding thresholds, in some cases eliminating the threshold altogether. We analyze the existence of a threshold for quantum low-density parity-check (LDPC) codes in the case of correlated erasures. When erasures are positively correlated, the corresponding multi-variate Bernoulli distribution can be modeled in terms of cluster errors, where qubits in clusters of various size can be marked all at once. In a code family with distance scaling as a power law of the code length, erasures can be always corrected below percolation on a qubit adjacency graph associated with the code. We bound this correlated percolation transition by weighted (uncorrelated) percolation on a specially constructed cluster connectivity graph, and apply our recent results to construct several bounds for the latter. This research was supported in part by the NSF Grant PHY-1416578 and by the ARO Grant W911NF-14-1-0272.

Distributed coding/decoding complexity in video sensor networks.

Science.gov (United States)

Cordeiro, Paulo J; Assunção, Pedro

2012-01-01

Video Sensor Networks (VSNs) are recent communication infrastructures used to capture and transmit dense visual information from an application context. In such large scale environments which include video coding, transmission and display/storage, there are several open problems to overcome in practical implementations. This paper addresses the most relevant challenges posed by VSNs, namely stringent bandwidth usage and processing time/power constraints. In particular, the paper proposes a novel VSN architecture where large sets of visual sensors with embedded processors are used for compression and transmission of coded streams to gateways, which in turn transrate the incoming streams and adapt them to the variable complexity requirements of both the sensor encoders and end-user decoder terminals. Such gateways provide real-time transcoding functionalities for bandwidth adaptation and coding/decoding complexity distribution by transferring the most complex video encoding/decoding tasks to the transcoding gateway at the expense of a limited increase in bit rate. Then, a method to reduce the decoding complexity, suitable for system-on-chip implementation, is proposed to operate at the transcoding gateway whenever decoders with constrained resources are targeted. The results show that the proposed method achieves good performance and its inclusion into the VSN infrastructure provides an additional level of complexity control functionality.

Best linear decoding of random mask images

International Nuclear Information System (INIS)

Woods, J.W.; Ekstrom, M.P.; Palmieri, T.M.; Twogood, R.E.

1975-01-01

In 1968 Dicke proposed coded imaging of x and γ rays via random pinholes. Since then, many authors have agreed with him that this technique can offer significant image improvement. A best linear decoding of the coded image is presented, and its superiority over the conventional matched filter decoding is shown. Experimental results in the visible light region are presented. (U.S.)

Observations on Polar Coding with CRC-Aided List Decoding

Science.gov (United States)

2016-09-01

TECHNICAL REPORT 3041 September 2016 Observations on Polar Coding with CRC-Aided List Decoding David Wasserman Approved for public release. SSC...described in [2, 3]. In FY15 and FY16 we used cyclic redundancy check (CRC)-aided polar list decoding [4]. Section 2 describes the basics of polar coding ...and gives details of the encoders and decoders we used. In the course of our research, we performed simulations of polar codes in hundreds of cases

Optimization of MPEG decoding

DEFF Research Database (Denmark)

Martins, Bo; Forchhammer, Søren

1999-01-01

MPEG-2 video decoding is examined. A unified approach to quality improvement, chrominance upsampling, de-interlacing and superresolution is presented. The information over several frames is combined as part of the processing....

Emotion Decoding and Incidental Processing Fluency as Antecedents of Attitude Certainty.

Science.gov (United States)

Petrocelli, John V; Whitmire, Melanie B

2017-07-01

Previous research demonstrates that attitude certainty influences the degree to which an attitude changes in response to persuasive appeals. In the current research, decoding emotions from facial expressions and incidental processing fluency, during attitude formation, are examined as antecedents of both attitude certainty and attitude change. In Experiment 1, participants who decoded anger or happiness during attitude formation expressed their greater attitude certainty, and showed more resistance to persuasion than participants who decoded sadness. By manipulating the emotion decoded, the diagnosticity of processing fluency experienced during emotion decoding, and the gaze direction of the social targets, Experiment 2 suggests that the link between emotion decoding and attitude certainty results from incidental processing fluency. Experiment 3 demonstrated that fluency in processing irrelevant stimuli influences attitude certainty, which in turn influences resistance to persuasion. Implications for appraisal-based accounts of attitude formation and attitude change are discussed.

Error Resilience in Current Distributed Video Coding Architectures

Directory of Open Access Journals (Sweden)

Tonoli Claudia

2009-01-01

Full Text Available In distributed video coding the signal prediction is shifted at the decoder side, giving therefore most of the computational complexity burden at the receiver. Moreover, since no prediction loop exists before transmission, an intrinsic robustness to transmission errors has been claimed. This work evaluates and compares the error resilience performance of two distributed video coding architectures. In particular, we have considered a video codec based on the Stanford architecture (DISCOVER codec and a video codec based on the PRISM architecture. Specifically, an accurate temporal and rate/distortion based evaluation of the effects of the transmission errors for both the considered DVC architectures has been performed and discussed. These approaches have been also compared with H.264/AVC, in both cases of no error protection, and simple FEC error protection. Our evaluations have highlighted in all cases a strong dependence of the behavior of the various codecs to the content of the considered video sequence. In particular, PRISM seems to be particularly well suited for low-motion sequences, whereas DISCOVER provides better performance in the other cases.

Error-Rate Bounds for Coded PPM on a Poisson Channel

Science.gov (United States)

Moision, Bruce; Hamkins, Jon

2009-01-01

Equations for computing tight bounds on error rates for coded pulse-position modulation (PPM) on a Poisson channel at high signal-to-noise ratio have been derived. These equations and elements of the underlying theory are expected to be especially useful in designing codes for PPM optical communication systems. The equations and the underlying theory apply, more specifically, to a case in which a) At the transmitter, a linear outer code is concatenated with an inner code that includes an accumulator and a bit-to-PPM-symbol mapping (see figure) [this concatenation is known in the art as "accumulate-PPM" (abbreviated "APPM")]; b) The transmitted signal propagates on a memoryless binary-input Poisson channel; and c) At the receiver, near-maximum-likelihood (ML) decoding is effected through an iterative process. Such a coding/modulation/decoding scheme is a variation on the concept of turbo codes, which have complex structures, such that an exact analytical expression for the performance of a particular code is intractable. However, techniques for accurately estimating the performances of turbo codes have been developed. The performance of a typical turbo code includes (1) a "waterfall" region consisting of a steep decrease of error rate with increasing signal-to-noise ratio (SNR) at low to moderate SNR, and (2) an "error floor" region with a less steep decrease of error rate with increasing SNR at moderate to high SNR. The techniques used heretofore for estimating performance in the waterfall region have differed from those used for estimating performance in the error-floor region. For coded PPM, prior to the present derivations, equations for accurate prediction of the performance of coded PPM at high SNR did not exist, so that it was necessary to resort to time-consuming simulations in order to make such predictions. The present derivation makes it unnecessary to perform such time-consuming simulations.

Decoding Problem Gamblers' Signals: A Decision Model for Casino Enterprises.

Science.gov (United States)

Ifrim, Sandra

2015-12-01

The aim of the present study is to offer a validated decision model for casino enterprises. The model enables those users to perform early detection of problem gamblers and fulfill their ethical duty of social cost minimization. To this end, the interpretation of casino customers' nonverbal communication is understood as a signal-processing problem. Indicators of problem gambling recommended by Delfabbro et al. (Identifying problem gamblers in gambling venues: final report, 2007) are combined with Viterbi algorithm into an interdisciplinary model that helps decoding signals emitted by casino customers. Model output consists of a historical path of mental states and cumulated social costs associated with a particular client. Groups of problem and non-problem gamblers were simulated to investigate the model's diagnostic capability and its cost minimization ability. Each group consisted of 26 subjects and was subsequently enlarged to 100 subjects. In approximately 95% of the cases, mental states were correctly decoded for problem gamblers. Statistical analysis using planned contrasts revealed that the model is relatively robust to the suppression of signals performed by casino clientele facing gambling problems as well as to misjudgments made by staff regarding the clients' mental states. Only if the last mentioned source of error occurs in a very pronounced manner, i.e. judgment is extremely faulty, cumulated social costs might be distorted.

Adaptive decoding of MPEG-4 sprites for memory-constrained embedded systems

NARCIS (Netherlands)

Pastrnak, M.; Farin, D.S.; With, de P.H.N.; Cardinal, J.; Cerf, N.; Delgrnage, O.

2005-01-01

Background sprite decoding is an essential part of object-based video coding.The composition and rendering of a final scene involves the placing of individual video objects in a predefined way superimposed on the decoded background image. The MPEG-4 standard includes the decoding algorithm for

Low Power LDPC Code Decoder Architecture Based on Intermediate Message Compression Technique

Science.gov (United States)

Shimizu, Kazunori; Togawa, Nozomu; Ikenaga, Takeshi; Goto, Satoshi

Reducing the power dissipation for LDPC code decoder is a major challenging task to apply it to the practical digital communication systems. In this paper, we propose a low power LDPC code decoder architecture based on an intermediate message-compression technique which features as follows: (i) An intermediate message compression technique enables the decoder to reduce the required memory capacity and write power dissipation. (ii) A clock gated shift register based intermediate message memory architecture enables the decoder to decompress the compressed messages in a single clock cycle while reducing the read power dissipation. The combination of the above two techniques enables the decoder to reduce the power dissipation while keeping the decoding throughput. The simulation results show that the proposed architecture improves the power efficiency up to 52% and 18% compared to that of the decoder based on the overlapped schedule and the rapid convergence schedule without the proposed techniques respectively.

Construction and decoding of a class of algebraic geometry codes

DEFF Research Database (Denmark)

Justesen, Jørn; Larsen, Knud J.; Jensen, Helge Elbrønd

1989-01-01

A class of codes derived from algebraic plane curves is constructed. The concepts and results from algebraic geometry that were used are explained in detail; no further knowledge of algebraic geometry is needed. Parameters, generator and parity-check matrices are given. The main result is a decod...... is a decoding algorithm which turns out to be a generalization of the Peterson algorithm for decoding BCH decoder codes......A class of codes derived from algebraic plane curves is constructed. The concepts and results from algebraic geometry that were used are explained in detail; no further knowledge of algebraic geometry is needed. Parameters, generator and parity-check matrices are given. The main result...

Multiformat decoder for a DSP-based IP set-top box

Science.gov (United States)

Pescador, F.; Garrido, M. J.; Sanz, C.; Juárez, E.; Samper, D.; Antoniello, R.

2007-05-01

Internet Protocol Set-Top Boxes (IP STBs) based on single-processor architectures have been recently introduced in the market. In this paper, the implementation of an MPEG-4 SP/ASP video decoder for a multi-format IP STB based on a TMS320DM641 DSP is presented. An initial decoder for PC platform was fully tested and ported to the DSP. Using this code an optimization process was started achieving a 90% speedup. This process allows real-time MPEG-4 SP/ASP decoding. The MPEG-4 decoder has been integrated in an IP STB and tested in a real environment using DVD movies and TV channels with excellent results.

A One-Pass Real-Time Decoder Using Memory-Efficient State Network

Science.gov (United States)

Shao, Jian; Li, Ta; Zhang, Qingqing; Zhao, Qingwei; Yan, Yonghong

This paper presents our developed decoder which adopts the idea of statically optimizing part of the knowledge sources while handling the others dynamically. The lexicon, phonetic contexts and acoustic model are statically integrated to form a memory-efficient state network, while the language model (LM) is dynamically incorporated on the fly by means of extended tokens. The novelties of our approach for constructing the state network are (1) introducing two layers of dummy nodes to cluster the cross-word (CW) context dependent fan-in and fan-out triphones, (2) introducing a so-called “WI layer” to store the word identities and putting the nodes of this layer in the non-shared mid-part of the network, (3) optimizing the network at state level by a sufficient forward and backward node-merge process. The state network is organized as a multi-layer structure for distinct token propagation at each layer. By exploiting the characteristics of the state network, several techniques including LM look-ahead, LM cache and beam pruning are specially designed for search efficiency. Especially in beam pruning, a layer-dependent pruning method is proposed to further reduce the search space. The layer-dependent pruning takes account of the neck-like characteristics of WI layer and the reduced variety of word endings, which enables tighter beam without introducing much search errors. In addition, other techniques including LM compression, lattice-based bookkeeping and lattice garbage collection are also employed to reduce the memory requirements. Experiments are carried out on a Mandarin spontaneous speech recognition task where the decoder involves a trigram LM and CW triphone models. A comparison with HDecode of HTK toolkits shows that, within 1% performance deviation, our decoder can run 5 times faster with half of the memory footprint.

Visual perception as retrospective Bayesian decoding from high- to low-level features.

Science.gov (United States)

Ding, Stephanie; Cueva, Christopher J; Tsodyks, Misha; Qian, Ning

2017-10-24

When a stimulus is presented, its encoding is known to progress from low- to high-level features. How these features are decoded to produce perception is less clear, and most models assume that decoding follows the same low- to high-level hierarchy of encoding. There are also theories arguing for global precedence, reversed hierarchy, or bidirectional processing, but they are descriptive without quantitative comparison with human perception. Moreover, observers often inspect different parts of a scene sequentially to form overall perception, suggesting that perceptual decoding requires working memory, yet few models consider how working-memory properties may affect decoding hierarchy. We probed decoding hierarchy by comparing absolute judgments of single orientations and relative/ordinal judgments between two sequentially presented orientations. We found that lower-level, absolute judgments failed to account for higher-level, relative/ordinal judgments. However, when ordinal judgment was used to retrospectively decode memory representations of absolute orientations, striking aspects of absolute judgments, including the correlation and forward/backward aftereffects between two reported orientations in a trial, were explained. We propose that the brain prioritizes decoding of higher-level features because they are more behaviorally relevant, and more invariant and categorical, and thus easier to specify and maintain in noisy working memory, and that more reliable higher-level decoding constrains less reliable lower-level decoding. Published under the PNAS license.

Optical RAM row access using WDM-enabled all-passive row/column decoders

Science.gov (United States)

Papaioannou, Sotirios; Alexoudi, Theoni; Kanellos, George T.; Miliou, Amalia; Pleros, Nikos

2014-03-01

Towards achieving a functional RAM organization that reaps the advantages offered by optical technology, a complete set of optical peripheral modules, namely the Row (RD) and Column Decoder (CD) units, is required. In this perspective, we demonstrate an all-passive 2×4 optical RAM RD with row access operation and subsequent all-passive column decoding to control the access of WDM-formatted words in optical RAM rows. The 2×4 RD exploits a WDM-formatted 2-bit-long memory WordLine address along with its complementary value, all of them encoded on four different wavelengths and broadcasted to all RAM rows. The RD relies on an all-passive wavelength-selective filtering matrix (λ-matrix) that ensures a logical `0' output only at the selected RAM row. Subsequently, the RD output of each row drives the respective SOA-MZI-based Row Access Gate (AG) to grant/block the entry of the incoming data words to the whole memory row. In case of a selected row, the data word exits the row AG and enters the respective CD that relies on an allpassive wavelength-selective Arrayed Waveguide Grating (AWG) for decoding the word bits into their individual columns. Both RD and CD procedures are carried out without requiring any active devices, assuming that the memory address and data word bits as well as their inverted values will be available in their optical form by the CPU interface. Proof-of-concept experimental verification exploiting cascaded pairs of AWGs as the λ-matrix is demonstrated at 10Gb/s, providing error-free operation with a peak power penalty lower than 0.2dB for all optical word channels.

An Improved Unscented Kalman Filter Based Decoder for Cortical Brain-Machine Interfaces.

Science.gov (United States)

Li, Simin; Li, Jie; Li, Zheng

2016-01-01

Brain-machine interfaces (BMIs) seek to connect brains with machines or computers directly, for application in areas such as prosthesis control. For this application, the accuracy of the decoding of movement intentions is crucial. We aim to improve accuracy by designing a better encoding model of primary motor cortical activity during hand movements and combining this with decoder engineering refinements, resulting in a new unscented Kalman filter based decoder, UKF2, which improves upon our previous unscented Kalman filter decoder, UKF1. The new encoding model includes novel acceleration magnitude, position-velocity interaction, and target-cursor-distance features (the decoder does not require target position as input, it is decoded). We add a novel probabilistic velocity threshold to better determine the user's intent to move. We combine these improvements with several other refinements suggested by others in the field. Data from two Rhesus monkeys indicate that the UKF2 generates offline reconstructions of hand movements (mean CC 0.851) significantly more accurately than the UKF1 (0.833) and the popular position-velocity Kalman filter (0.812). The encoding model of the UKF2 could predict the instantaneous firing rate of neurons (mean CC 0.210), given kinematic variables and past spiking, better than the encoding models of these two decoders (UKF1: 0.138, p-v Kalman: 0.098). In closed-loop experiments where each monkey controlled a computer cursor with each decoder in turn, the UKF2 facilitated faster task completion (mean 1.56 s vs. 2.05 s) and higher Fitts's Law bit rate (mean 0.738 bit/s vs. 0.584 bit/s) than the UKF1. These results suggest that the modeling and decoder engineering refinements of the UKF2 improve decoding performance. We believe they can be used to enhance other decoders as well.

EXIT Chart Analysis of Binary Message-Passing Decoders

DEFF Research Database (Denmark)

Lechner, Gottfried; Pedersen, Troels; Kramer, Gerhard

2007-01-01

Binary message-passing decoders for LDPC codes are analyzed using EXIT charts. For the analysis, the variable node decoder performs all computations in the L-value domain. For the special case of a hard decision channel, this leads to the well know Gallager B algorithm, while the analysis can...... be extended to channels with larger output alphabets. By increasing the output alphabet from hard decisions to four symbols, a gain of more than 1.0 dB is achieved using optimized codes. For this code optimization, the mixing property of EXIT functions has to be modified to the case of binary message......-passing decoders....

Locating and decoding barcodes in fuzzy images captured by smart phones

Science.gov (United States)

Deng, Wupeng; Hu, Jiwei; Liu, Quan; Lou, Ping

2017-07-01

With the development of barcodes for commercial use, people's requirements for detecting barcodes by smart phone become increasingly pressing. The low quality of barcode image captured by mobile phone always affects the decoding and recognition rates. This paper focuses on locating and decoding EAN-13 barcodes in fuzzy images. We present a more accurate locating algorithm based on segment length and high fault-tolerant rate algorithm for decoding barcodes. Unlike existing approaches, location algorithm is based on the edge segment length of EAN -13 barcodes, while our decoding algorithm allows the appearance of fuzzy region in barcode image. Experimental results are performed on damaged, contaminated and scratched digital images, and provide a quite promising result for EAN -13 barcode location and decoding.

Decoding Hermitian Codes with Sudan's Algorithm

DEFF Research Database (Denmark)

Høholdt, Tom; Nielsen, Rasmus Refslund

1999-01-01

We present an efficient implementation of Sudan's algorithm for list decoding Hermitian codes beyond half the minimum distance. The main ingredients are an explicit method to calculate so-called increasing zero bases, an efficient interpolation algorithm for finding the Q-polynomial, and a reduct......We present an efficient implementation of Sudan's algorithm for list decoding Hermitian codes beyond half the minimum distance. The main ingredients are an explicit method to calculate so-called increasing zero bases, an efficient interpolation algorithm for finding the Q...

Low Complexity Approach for High Throughput Belief-Propagation based Decoding of LDPC Codes

Directory of Open Access Journals (Sweden)

BOT, A.

2013-11-01

Full Text Available The paper proposes a low complexity belief propagation (BP based decoding algorithm for LDPC codes. In spite of the iterative nature of the decoding process, the proposed algorithm provides both reduced complexity and increased BER performances as compared with the classic min-sum (MS algorithm, generally used for hardware implementations. Linear approximations of check-nodes update function are used in order to reduce the complexity of the BP algorithm. Considering this decoding approach, an FPGA based hardware architecture is proposed for implementing the decoding algorithm, aiming to increase the decoder throughput. FPGA technology was chosen for the LDPC decoder implementation, due to its parallel computation and reconfiguration capabilities. The obtained results show improvements regarding decoding throughput and BER performances compared with state-of-the-art approaches.

Firing rate estimation using infinite mixture models and its application to neural decoding.

Science.gov (United States)

Shibue, Ryohei; Komaki, Fumiyasu

2017-11-01

Neural decoding is a framework for reconstructing external stimuli from spike trains recorded by various neural recordings. Kloosterman et al. proposed a new decoding method using marked point processes (Kloosterman F, Layton SP, Chen Z, Wilson MA. J Neurophysiol 111: 217-227, 2014). This method does not require spike sorting and thereby improves decoding accuracy dramatically. In this method, they used kernel density estimation to estimate intensity functions of marked point processes. However, the use of kernel density estimation causes problems such as low decoding accuracy and high computational costs. To overcome these problems, we propose a new decoding method using infinite mixture models to estimate intensity. The proposed method improves decoding performance in terms of accuracy and computational speed. We apply the proposed method to simulation and experimental data to verify its performance. NEW & NOTEWORTHY We propose a new neural decoding method using infinite mixture models and nonparametric Bayesian statistics. The proposed method improves decoding performance in terms of accuracy and computation speed. We have successfully applied the proposed method to position decoding from spike trains recorded in a rat hippocampus. Copyright © 2017 the American Physiological Society.

ERROR-CONTROL CODING OF ADS-B MESSAGES FOR IRIDIUM SATELLITES

Directory of Open Access Journals (Sweden)

Volodymyr Kharchenko

2013-12-01

Full Text Available For modelling of ADS-B messages transmitting on the base of low-orbit satellite constellation Іrіdіum the model of a communication channel “Aircraft - Satellite - Ground Station” was built using MATLAB Sіmulіnk. This model allowed to investigate dependences of the Bit Error Rate on a type of  signal coding/decoding, ratio Eb/N0 and satellite repeater gain

Defective ribosome assembly in Shwachman-Diamond syndrome.

Science.gov (United States)

Wong, Chi C; Traynor, David; Basse, Nicolas; Kay, Robert R; Warren, Alan J

2011-10-20

Shwachman-Diamond syndrome (SDS), a recessive leukemia predisposition disorder characterized by bone marrow failure, exocrine pancreatic insufficiency, skeletal abnormalities and poor growth, is caused by mutations in the highly conserved SBDS gene. Here, we test the hypothesis that defective ribosome biogenesis underlies the pathogenesis of SDS. We create conditional mutants in the essential SBDS ortholog of the ancient eukaryote Dictyostelium discoideum using temperature-sensitive, self-splicing inteins, showing that mutant cells fail to grow at the restrictive temperature because ribosomal subunit joining is markedly impaired. Remarkably, wild type human SBDS complements the growth and ribosome assembly defects in mutant Dictyostelium cells, but disease-associated human SBDS variants are defective. SBDS directly interacts with the GTPase elongation factor-like 1 (EFL1) on nascent 60S subunits in vivo and together they catalyze eviction of the ribosome antiassociation factor eukaryotic initiation factor 6 (eIF6), a prerequisite for the translational activation of ribosomes. Importantly, lymphoblasts from SDS patients harbor a striking defect in ribosomal subunit joining whose magnitude is inversely proportional to the level of SBDS protein. These findings in Dictyostelium and SDS patient cells provide compelling support for the hypothesis that SDS is a ribosomopathy caused by corruption of an essential cytoplasmic step in 60S subunit maturation.

Electrophysiological difference between mental state decoding and mental state reasoning.

Science.gov (United States)

Cao, Bihua; Li, Yiyuan; Li, Fuhong; Li, Hong

2012-06-29

Previous studies have explored the neural mechanism of Theory of Mind (ToM), but the neural correlates of its two components, mental state decoding and mental state reasoning, remain unclear. In the present study, participants were presented with various photographs, showing an actor looking at 1 of 2 objects, either with a happy or an unhappy expression. They were asked to either decode the emotion of the actor (mental state decoding task), predict which object would be chosen by the actor (mental state reasoning task), or judge at which object the actor was gazing (physical task), while scalp potentials were recorded. Results showed that (1) the reasoning task elicited an earlier N2 peak than the decoding task did over the prefrontal scalp sites; and (2) during the late positive component (240-440 ms), the reasoning task elicited a more positive deflection than the other two tasks did at the prefrontal scalp sites. In addition, neither the decoding task nor the reasoning task has no left/right hemisphere difference. These findings imply that mental state reasoning differs from mental state decoding early (210 ms) after stimulus onset, and that the prefrontal lobe is the neural basis of mental state reasoning. Copyright © 2012 Elsevier B.V. All rights reserved.

Partially blind instantly decodable network codes for lossy feedback environment

KAUST Repository

Sorour, Sameh

2014-09-01

In this paper, we study the multicast completion and decoding delay minimization problems for instantly decodable network coding (IDNC) in the case of lossy feedback. When feedback loss events occur, the sender falls into uncertainties about packet reception at the different receivers, which forces it to perform partially blind selections of packet combinations in subsequent transmissions. To determine efficient selection policies that reduce the completion and decoding delays of IDNC in such an environment, we first extend the perfect feedback formulation in our previous works to the lossy feedback environment, by incorporating the uncertainties resulting from unheard feedback events in these formulations. For the completion delay problem, we use this formulation to identify the maximum likelihood state of the network in events of unheard feedback and employ it to design a partially blind graph update extension to the multicast IDNC algorithm in our earlier work. For the decoding delay problem, we derive an expression for the expected decoding delay increment for any arbitrary transmission. This expression is then used to find the optimal policy that reduces the decoding delay in such lossy feedback environment. Results show that our proposed solutions both outperform previously proposed approaches and achieve tolerable degradation even at relatively high feedback loss rates.

Emerging functions of ribosomal proteins in gene-specific transcription and translation

International Nuclear Information System (INIS)

Lindstroem, Mikael S.

2009-01-01

Ribosomal proteins have remained highly conserved during evolution presumably reflecting often critical functions in ribosome biogenesis or mature ribosome function. In addition, several ribosomal proteins possess distinct extra-ribosomal functions in apoptosis, DNA repair and transcription. An increasing number of ribosomal proteins have been shown to modulate the trans-activation function of important regulatory proteins such as NF-κB, p53, c-Myc and nuclear receptors. Furthermore, a subset of ribosomal proteins can bind directly to untranslated regions of mRNA resulting in transcript-specific translational control outside of the ribosome itself. Collectively, these findings suggest that ribosomal proteins may have a wider functional repertoire within the cell than previously thought. The future challenge is to identify and validate these novel functions in the background of an often essential primary function in ribosome biogenesis and cell growth.

Complexity Analysis of Reed-Solomon Decoding over GF without Using Syndromes

Directory of Open Access Journals (Sweden)

Chen Ning

2008-01-01

Full Text Available Abstract There has been renewed interest in decoding Reed-Solomon (RS codes without using syndromes recently. In this paper, we investigate the complexity of syndromeless decoding, and compare it to that of syndrome-based decoding. Aiming to provide guidelines to practical applications, our complexity analysis focuses on RS codes over characteristic-2 fields, for which some multiplicative FFT techniques are not applicable. Due to moderate block lengths of RS codes in practice, our analysis is complete, without big notation. In addition to fast implementation using additive FFT techniques, we also consider direct implementation, which is still relevant for RS codes with moderate lengths. For high-rate RS codes, when compared to syndrome-based decoding algorithms, not only syndromeless decoding algorithms require more field operations regardless of implementation, but also decoder architectures based on their direct implementations have higher hardware costs and lower throughput. We also derive tighter bounds on the complexities of fast polynomial multiplications based on Cantor's approach and the fast extended Euclidean algorithm.

A quantum algorithm for Viterbi decoding of classical convolutional codes

OpenAIRE

Grice, Jon R.; Meyer, David A.

2014-01-01

We present a quantum Viterbi algorithm (QVA) with better than classical performance under certain conditions. In this paper the proposed algorithm is applied to decoding classical convolutional codes, for instance; large constraint length $Q$ and short decode frames $N$. Other applications of the classical Viterbi algorithm where $Q$ is large (e.g. speech processing) could experience significant speedup with the QVA. The QVA exploits the fact that the decoding trellis is similar to the butter...

Design of a VLSI Decoder for Partially Structured LDPC Codes

Directory of Open Access Journals (Sweden)

Fabrizio Vacca

2008-01-01

of their parity matrix can be partitioned into two disjoint sets, namely, the structured and the random ones. For the proposed class of codes a constructive design method is provided. To assess the value of this method the constructed codes performance are presented. From these results, a novel decoding method called split decoding is introduced. Finally, to prove the effectiveness of the proposed approach a whole VLSI decoder is designed and characterized.

Kernel Temporal Differences for Neural Decoding

Science.gov (United States)

Bae, Jihye; Sanchez Giraldo, Luis G.; Pohlmeyer, Eric A.; Francis, Joseph T.; Sanchez, Justin C.; Príncipe, José C.

2015-01-01

We study the feasibility and capability of the kernel temporal difference (KTD)(λ) algorithm for neural decoding. KTD(λ) is an online, kernel-based learning algorithm, which has been introduced to estimate value functions in reinforcement learning. This algorithm combines kernel-based representations with the temporal difference approach to learning. One of our key observations is that by using strictly positive definite kernels, algorithm's convergence can be guaranteed for policy evaluation. The algorithm's nonlinear functional approximation capabilities are shown in both simulations of policy evaluation and neural decoding problems (policy improvement). KTD can handle high-dimensional neural states containing spatial-temporal information at a reasonable computational complexity allowing real-time applications. When the algorithm seeks a proper mapping between a monkey's neural states and desired positions of a computer cursor or a robot arm, in both open-loop and closed-loop experiments, it can effectively learn the neural state to action mapping. Finally, a visualization of the coadaptation process between the decoder and the subject shows the algorithm's capabilities in reinforcement learning brain machine interfaces. PMID:25866504

Row Reduction Applied to Decoding of Rank Metric and Subspace Codes

DEFF Research Database (Denmark)

Puchinger, Sven; Nielsen, Johan Sebastian Rosenkilde; Li, Wenhui

2017-01-01

We show that decoding of ℓ-Interleaved Gabidulin codes, as well as list-ℓ decoding of Mahdavifar–Vardy (MV) codes can be performed by row reducing skew polynomial matrices. Inspired by row reduction of F[x] matrices, we develop a general and flexible approach of transforming matrices over skew...... polynomial rings into a certain reduced form. We apply this to solve generalised shift register problems over skew polynomial rings which occur in decoding ℓ-Interleaved Gabidulin codes. We obtain an algorithm with complexity O(ℓμ2) where μ measures the size of the input problem and is proportional...... to the code length n in the case of decoding. Further, we show how to perform the interpolation step of list-ℓ-decoding MV codes in complexity O(ℓn2), where n is the number of interpolation constraints....

High-Performance Region-of-Interest Image Error Concealment with Hiding Technique

Directory of Open Access Journals (Sweden)

Shih-Chang Hsia

2010-01-01

Full Text Available Recently region-of-interest (ROI based image coding is a popular topic. Since ROI area contains much more important information for an image, it must be prevented from error decoding while suffering from channel lost or unexpected attack. This paper presents an efficient error concealment method to recover ROI information with a hiding technique. Based on the progressive transformation, the low-frequency components of ROI are encoded to disperse its information into the high-frequency bank of original image. The capability of protection is carried out with extracting the ROI coefficients from the damaged image without increasing extra information. Simulation results show that the proposed method can efficiently reconstruct the ROI image when ROI bit-stream occurs errors, and the measurement of PSNR result outperforms the conventional error concealment techniques by 2 to 5 dB.

Exact performance analysis of decode-and-forward opportunistic relaying

KAUST Repository

Tourki, Kamel

2010-06-01

In this paper, we investigate a dual-hop decode-and-forward opportunistic relaying scheme where the source may or may not be able to communicate directly with the destination. In our study, we consider a regenerative relaying scheme in which the decision to cooperate takes into account the effect of the possible erroneously detected and transmitted data at the best relay. We derive an exact closed-form expression for the end-to-end bit-error rate (BER) of binary phase-shift keying (BPSK) modulation based on the exact statistics of each hop. Unlike existing works where the analysis focused on high signal-to-noise ratio (SNR) regime, such results are important to enable the designers to take decisions regarding practical systems that operate at low SNR regime. We show that performance simulation results coincide with our analytical results.

Coding/decoding two-dimensional images with orbital angular momentum of light.

Science.gov (United States)

Chu, Jiaqi; Li, Xuefeng; Smithwick, Quinn; Chu, Daping

2016-04-01

We investigate encoding and decoding of two-dimensional information using the orbital angular momentum (OAM) of light. Spiral phase plates and phase-only spatial light modulators are used in encoding and decoding of OAM states, respectively. We show that off-axis points and spatial variables encoded with a given OAM state can be recovered through decoding with the corresponding complimentary OAM state.

A simple approach to ignoring irrelevant variables by population decoding based on multisensory neurons

Science.gov (United States)

Kim, HyungGoo R.; Pitkow, Xaq; Angelaki, Dora E.

2016-01-01

Sensory input reflects events that occur in the environment, but multiple events may be confounded in sensory signals. For example, under many natural viewing conditions, retinal image motion reflects some combination of self-motion and movement of objects in the world. To estimate one stimulus event and ignore others, the brain can perform marginalization operations, but the neural bases of these operations are poorly understood. Using computational modeling, we examine how multisensory signals may be processed to estimate the direction of self-motion (i.e., heading) and to marginalize out effects of object motion. Multisensory neurons represent heading based on both visual and vestibular inputs and come in two basic types: “congruent” and “opposite” cells. Congruent cells have matched heading tuning for visual and vestibular cues and have been linked to perceptual benefits of cue integration during heading discrimination. Opposite cells have mismatched visual and vestibular heading preferences and are ill-suited for cue integration. We show that decoding a mixed population of congruent and opposite cells substantially reduces errors in heading estimation caused by object motion. In addition, we present a general formulation of an optimal linear decoding scheme that approximates marginalization and can be implemented biologically by simple reinforcement learning mechanisms. We also show that neural response correlations induced by task-irrelevant variables may greatly exceed intrinsic noise correlations. Overall, our findings suggest a general computational strategy by which neurons with mismatched tuning for two different sensory cues may be decoded to perform marginalization operations that dissociate possible causes of sensory inputs. PMID:27334948

Eukaryotic ribosome display with in situ DNA recovery.

Science.gov (United States)

He, Mingyue; Edwards, Bryan M; Kastelic, Damjana; Taussig, Michael J

2012-01-01

Ribosome display is a cell-free display technology for in vitro selection and optimisation of proteins from large diversified libraries. It operates through the formation of stable protein-ribosome-mRNA (PRM) complexes and selection of ligand-binding proteins, followed by DNA recovery from the selected genetic information. Both prokaryotic and eukaryotic ribosome display systems have been developed. In this chapter, we describe the eukaryotic rabbit reticulocyte method in which a distinct in situ single-primer RT-PCR procedure is used to recover DNA from the selected PRM complexes without the need for prior disruption of the ribosome.

ESVD: An Integrated Energy Scalable Framework for Low-Power Video Decoding Systems

Directory of Open Access Journals (Sweden)

Wen Ji

2010-01-01

Full Text Available Video applications using mobile wireless devices are a challenging task due to the limited capacity of batteries. The higher complex functionality of video decoding needs high resource requirements. Thus, power efficient control has become more critical design with devices integrating complex video processing techniques. Previous works on power efficient control in video decoding systems often aim at the low complexity design and not explicitly consider the scalable impact of subfunctions in decoding process, and seldom consider the relationship with the features of compressed video date. This paper is dedicated to developing an energy-scalable video decoding (ESVD strategy for energy-limited mobile terminals. First, ESVE can dynamically adapt the variable energy resources due to the device aware technique. Second, ESVD combines the decoder control with decoded data, through classifying the data into different partition profiles according to its characteristics. Third, it introduces utility theoretical analysis during the resource allocation process, so as to maximize the resource utilization. Finally, it adapts the energy resource as different energy budget and generates the scalable video decoding output under energy-limited systems. Experimental results demonstrate the efficiency of the proposed approach.

Design and Implementation of Convolutional Encoder and Viterbi Decoder Using FPGA.

Directory of Open Access Journals (Sweden)

Riham Ali Zbaid

2018-01-01

Full Text Available Keeping  the  fineness of data is the most significant thing in communication.There are many factors that affect the accuracy of the data when it is transmitted over the communication channel such as noise etc. to overcome these effects are encoding channels encryption.In this paper is used for one type of channel coding is convolutional codes. Convolution encoding is a Forward Error Correction (FEC method used in incessant one-way and real time communication links .It can offer a great development in the error bit rates so that small, low energy, and devices cheap transmission when used in applications such as satellites. In this paper highlight the design, simulation and implementation of convolution encoder and Viterbi decoder by using MATLAB- program (2011. SIMULINK HDL coder is used to convert MATLAB-SIMULINK models to VHDL using plates Altera Cyclone II code DE2-70. Simulation and evaluation of the implementation of the results coincided with the results of the design show the coinciding with the designed results.

Delay reduction in lossy intermittent feedback for generalized instantly decodable network coding

KAUST Repository

Douik, Ahmed S.

2013-10-01

In this paper, we study the effect of lossy intermittent feedback loss events on the multicast decoding delay performance of generalized instantly decodable network coding. These feedback loss events create uncertainty at the sender about the reception statues of different receivers and thus uncertainty to accurately determine subsequent instantly decodable coded packets. To solve this problem, we first identify the different possibilities of uncertain packets at the sender and their probabilities. We then derive the expression of the mean decoding delay. We formulate the Generalized Instantly Decodable Network Coding (G-IDNC) minimum decoding delay problem as a maximum weight clique problem. Since finding the optimal solution is NP-hard, we design a variant of the algorithm employed in [1]. Our algorithm is compared to the two blind graph update proposed in [2] through extensive simulations. Results show that our algorithm outperforms the blind approaches in all the situations and achieves a tolerable degradation, against the perfect feedback, for large feedback loss period. © 2013 IEEE.

Delay reduction in lossy intermittent feedback for generalized instantly decodable network coding

KAUST Repository

Douik, Ahmed S.; Sorour, Sameh; Alouini, Mohamed-Slim; Ai-Naffouri, Tareq Y.

2013-01-01

In this paper, we study the effect of lossy intermittent feedback loss events on the multicast decoding delay performance of generalized instantly decodable network coding. These feedback loss events create uncertainty at the sender about the reception statues of different receivers and thus uncertainty to accurately determine subsequent instantly decodable coded packets. To solve this problem, we first identify the different possibilities of uncertain packets at the sender and their probabilities. We then derive the expression of the mean decoding delay. We formulate the Generalized Instantly Decodable Network Coding (G-IDNC) minimum decoding delay problem as a maximum weight clique problem. Since finding the optimal solution is NP-hard, we design a variant of the algorithm employed in [1]. Our algorithm is compared to the two blind graph update proposed in [2] through extensive simulations. Results show that our algorithm outperforms the blind approaches in all the situations and achieves a tolerable degradation, against the perfect feedback, for large feedback loss period. © 2013 IEEE.

Video error concealment using block matching and frequency selective extrapolation algorithms

Science.gov (United States)

P. K., Rajani; Khaparde, Arti

2017-06-01

Error Concealment (EC) is a technique at the decoder side to hide the transmission errors. It is done by analyzing the spatial or temporal information from available video frames. It is very important to recover distorted video because they are used for various applications such as video-telephone, video-conference, TV, DVD, internet video streaming, video games etc .Retransmission-based and resilient-based methods, are also used for error removal. But these methods add delay and redundant data. So error concealment is the best option for error hiding. In this paper, the error concealment methods such as Block Matching error concealment algorithm is compared with Frequency Selective Extrapolation algorithm. Both the works are based on concealment of manually error video frames as input. The parameter used for objective quality measurement was PSNR (Peak Signal to Noise Ratio) and SSIM(Structural Similarity Index). The original video frames along with error video frames are compared with both the Error concealment algorithms. According to simulation results, Frequency Selective Extrapolation is showing better quality measures such as 48% improved PSNR and 94% increased SSIM than Block Matching Algorithm.

Efficient Dual Domain Decoding of Linear Block Codes Using Genetic Algorithms

Directory of Open Access Journals (Sweden)

Ahmed Azouaoui

2012-01-01

Full Text Available A computationally efficient algorithm for decoding block codes is developed using a genetic algorithm (GA. The proposed algorithm uses the dual code in contrast to the existing genetic decoders in the literature that use the code itself. Hence, this new approach reduces the complexity of decoding the codes of high rates. We simulated our algorithm in various transmission channels. The performance of this algorithm is investigated and compared with competitor decoding algorithms including Maini and Shakeel ones. The results show that the proposed algorithm gives large gains over the Chase-2 decoding algorithm and reach the performance of the OSD-3 for some quadratic residue (QR codes. Further, we define a new crossover operator that exploits the domain specific information and compare it with uniform and two point crossover. The complexity of this algorithm is also discussed and compared to other algorithms.

Coding and decoding for code division multiple user communication systems

Science.gov (United States)

Healy, T. J.

1985-01-01

A new algorithm is introduced which decodes code division multiple user communication signals. The algorithm makes use of the distinctive form or pattern of each signal to separate it from the composite signal created by the multiple users. Although the algorithm is presented in terms of frequency-hopped signals, the actual transmitter modulator can use any of the existing digital modulation techniques. The algorithm is applicable to error-free codes or to codes where controlled interference is permitted. It can be used when block synchronization is assumed, and in some cases when it is not. The paper also discusses briefly some of the codes which can be used in connection with the algorithm, and relates the algorithm to past studies which use other approaches to the same problem.

Optimal coding-decoding for systems controlled via a communication channel

Science.gov (United States)

Yi-wei, Feng; Guo, Ge

2013-12-01

In this article, we study the problem of controlling plants over a signal-to-noise ratio (SNR) constrained communication channel. Different from previous research, this article emphasises the importance of the actual channel model and coder/decoder in the study of network performance. Our major objectives include coder/decoder design for an additive white Gaussian noise (AWGN) channel with both standard network configuration and Youla parameter network architecture. We find that the optimal coder and decoder can be realised for different network configuration. The results are useful in determining the minimum channel capacity needed in order to stabilise plants over communication channels. The coder/decoder obtained can be used to analyse the effect of uncertainty on the channel capacity. An illustrative example is provided to show the effectiveness of the results.

Frame Decoder for Consultative Committee for Space Data Systems (CCSDS)

Science.gov (United States)

Reyes, Miguel A. De Jesus

2014-01-01

GNU Radio is a free and open source development toolkit that provides signal processing to implement software radios. It can be used with low-cost external RF hardware to create software defined radios, or without hardware in a simulation-like environment. GNU Radio applications are primarily written in Python and C++. The Universal Software Radio Peripheral (USRP) is a computer-hosted software radio designed by Ettus Research. The USRP connects to a host computer via high-speed Gigabit Ethernet. Using the open source Universal Hardware Driver (UHD), we can run GNU Radio applications using the USRP. An SDR is a "radio in which some or all physical layer functions are software defined"(IEEE Definition). A radio is any kind of device that wirelessly transmits or receives radio frequency (RF) signals in the radio frequency. An SDR is a radio communication system where components that have been typically implemented in hardware are implemented in software. GNU Radio has a generic packet decoder block that is not optimized for CCSDS frames. Using this generic packet decoder will add bytes to the CCSDS frames and will not permit for bit error correction using Reed-Solomon. The CCSDS frames consist of 256 bytes, including a 32-bit sync marker (0x1ACFFC1D). This frames are generated by the Space Data Processor and GNU Radio will perform the modulation and framing operations, including frame synchronization.

Heterogeneous Ribosomes Preferentially Translate Distinct Subpools of mRNAs Genome-wide.

Science.gov (United States)

Shi, Zhen; Fujii, Kotaro; Kovary, Kyle M; Genuth, Naomi R; Röst, Hannes L; Teruel, Mary N; Barna, Maria

2017-07-06

Emerging studies have linked the ribosome to more selective control of gene regulation. However, an outstanding question is whether ribosome heterogeneity at the level of core ribosomal proteins (RPs) exists and enables ribosomes to preferentially translate specific mRNAs genome-wide. Here, we measured the absolute abundance of RPs in translating ribosomes and profiled transcripts that are enriched or depleted from select subsets of ribosomes within embryonic stem cells. We find that heterogeneity in RP composition endows ribosomes with differential selectivity for translating subpools of transcripts, including those controlling metabolism, cell cycle, and development. As an example, mRNAs enriched in binding to RPL10A/uL1-containing ribosomes are shown to require RPL10A/uL1 for their efficient translation. Within several of these transcripts, this level of regulation is mediated, at least in part, by internal ribosome entry sites. Together, these results reveal a critical functional link between ribosome heterogeneity and the post-transcriptional circuitry of gene expression. Copyright © 2017 Elsevier Inc. All rights reserved.

Effect of sodium fluoride on the amount of polyribosomes, single ribosomes and ribosomal subunits in a cellular slime mold, Dictyostelium discoideum

Energy Technology Data Exchange (ETDEWEB)

Sameshima, M; Ito, K; Iwabuchi, M

1972-01-01

In the slime mold, Dictyostelium discoideum, when the rate of protein synthesis was decreased by NaF, free 80-S ribosomes accumulated at the expense of polyribosomes, while 60-S and 40-S ribosomal subunits remained almost constant. The same level of ribosomal subunits was also maintained in cells after incubation with cycloheximide or at the stationary phase of growth.

Achievable Information Rates for Coded Modulation With Hard Decision Decoding for Coherent Fiber-Optic Systems

Science.gov (United States)

Sheikh, Alireza; Amat, Alexandre Graell i.; Liva, Gianluigi

2017-12-01

We analyze the achievable information rates (AIRs) for coded modulation schemes with QAM constellations with both bit-wise and symbol-wise decoders, corresponding to the case where a binary code is used in combination with a higher-order modulation using the bit-interleaved coded modulation (BICM) paradigm and to the case where a nonbinary code over a field matched to the constellation size is used, respectively. In particular, we consider hard decision decoding, which is the preferable option for fiber-optic communication systems where decoding complexity is a concern. Recently, Liga \\emph{et al.} analyzed the AIRs for bit-wise and symbol-wise decoders considering what the authors called \\emph{hard decision decoder} which, however, exploits \\emph{soft information} of the transition probabilities of discrete-input discrete-output channel resulting from the hard detection. As such, the complexity of the decoder is essentially the same as the complexity of a soft decision decoder. In this paper, we analyze instead the AIRs for the standard hard decision decoder, commonly used in practice, where the decoding is based on the Hamming distance metric. We show that if standard hard decision decoding is used, bit-wise decoders yield significantly higher AIRs than symbol-wise decoders. As a result, contrary to the conclusion by Liga \\emph{et al.}, binary decoders together with the BICM paradigm are preferable for spectrally-efficient fiber-optic systems. We also design binary and nonbinary staircase codes and show that, in agreement with the AIRs, binary codes yield better performance.

Ribosome dynamics and tRNA movement by time-resolved electron cryomicroscopy.

Science.gov (United States)

Fischer, Niels; Konevega, Andrey L; Wintermeyer, Wolfgang; Rodnina, Marina V; Stark, Holger

2010-07-15

The translocation step of protein synthesis entails large-scale rearrangements of the ribosome-transfer RNA (tRNA) complex. Here we have followed tRNA movement through the ribosome during translocation by time-resolved single-particle electron cryomicroscopy (cryo-EM). Unbiased computational sorting of cryo-EM images yielded 50 distinct three-dimensional reconstructions, showing the tRNAs in classical, hybrid and various novel intermediate states that provide trajectories and kinetic information about tRNA movement through the ribosome. The structures indicate how tRNA movement is coupled with global and local conformational changes of the ribosome, in particular of the head and body of the small ribosomal subunit, and show that dynamic interactions between tRNAs and ribosomal residues confine the path of the tRNAs through the ribosome. The temperature dependence of ribosome dynamics reveals a surprisingly flat energy landscape of conformational variations at physiological temperature. The ribosome functions as a Brownian machine that couples spontaneous conformational changes driven by thermal energy to directed movement.

Decoding Individual Finger Movements from One Hand Using Human EEG Signals

Science.gov (United States)

Gonzalez, Jania; Ding, Lei

2014-01-01

Brain computer interface (BCI) is an assistive technology, which decodes neurophysiological signals generated by the human brain and translates them into control signals to control external devices, e.g., wheelchairs. One problem challenging noninvasive BCI technologies is the limited control dimensions from decoding movements of, mainly, large body parts, e.g., upper and lower limbs. It has been reported that complicated dexterous functions, i.e., finger movements, can be decoded in electrocorticography (ECoG) signals, while it remains unclear whether noninvasive electroencephalography (EEG) signals also have sufficient information to decode the same type of movements. Phenomena of broadband power increase and low-frequency-band power decrease were observed in EEG in the present study, when EEG power spectra were decomposed by a principal component analysis (PCA). These movement-related spectral structures and their changes caused by finger movements in EEG are consistent with observations in previous ECoG study, as well as the results from ECoG data in the present study. The average decoding accuracy of 77.11% over all subjects was obtained in classifying each pair of fingers from one hand using movement-related spectral changes as features to be decoded using a support vector machine (SVM) classifier. The average decoding accuracy in three epilepsy patients using ECoG data was 91.28% with the similarly obtained features and same classifier. Both decoding accuracies of EEG and ECoG are significantly higher than the empirical guessing level (51.26%) in all subjects (pEEG as in ECoG, and demonstrates the feasibility of discriminating finger movements from one hand using EEG. These findings are promising to facilitate the development of BCIs with rich control signals using noninvasive technologies. PMID:24416360

Iterative decoding of SOVA and LDPC product code for bit-patterned media recoding

Science.gov (United States)

Jeong, Seongkwon; Lee, Jaejin

2018-05-01

The demand for high-density storage systems has increased due to the exponential growth of data. Bit-patterned media recording (BPMR) is one of the promising technologies to achieve the density of 1Tbit/in2 and higher. To increase the areal density in BPMR, the spacing between islands needs to be reduced, yet this aggravates inter-symbol interference and inter-track interference and degrades the bit error rate performance. In this paper, we propose a decision feedback scheme using low-density parity check (LDPC) product code for BPMR. This scheme can improve the decoding performance using an iterative approach with extrinsic information and log-likelihood ratio value between iterative soft output Viterbi algorithm and LDPC product code. Simulation results show that the proposed LDPC product code can offer 1.8dB and 2.3dB gains over the one LDPC code at the density of 2.5 and 3 Tb/in2, respectively, when bit error rate is 10-6.

Error Correction using Quantum Quasi-Cyclic Low-Density Parity-Check(LDPC) Codes

Science.gov (United States)

Jing, Lin; Brun, Todd; Quantum Research Team

Quasi-cyclic LDPC codes can approach the Shannon capacity and have efficient decoders. Manabu Hagiwara et al., 2007 presented a method to calculate parity check matrices with high girth. Two distinct, orthogonal matrices Hc and Hd are used. Using submatrices obtained from Hc and Hd by deleting rows, we can alter the code rate. The submatrix of Hc is used to correct Pauli X errors, and the submatrix of Hd to correct Pauli Z errors. We simulated this system for depolarizing noise on USC's High Performance Computing Cluster, and obtained the block error rate (BER) as a function of the error weight and code rate. From the rates of uncorrectable errors under different error weights we can extrapolate the BER to any small error probability. Our results show that this code family can perform reasonably well even at high code rates, thus considerably reducing the overhead compared to concatenated and surface codes. This makes these codes promising as storage blocks in fault-tolerant quantum computation. Error Correction using Quantum Quasi-Cyclic Low-Density Parity-Check(LDPC) Codes.

Application of source biasing technique for energy efficient DECODER circuit design: memory array application

Science.gov (United States)

Gupta, Neha; Parihar, Priyanka; Neema, Vaibhav

2018-04-01

Researchers have proposed many circuit techniques to reduce leakage power dissipation in memory cells. If we want to reduce the overall power in the memory system, we have to work on the input circuitry of memory architecture i.e. row and column decoder. In this research work, low leakage power with a high speed row and column decoder for memory array application is designed and four new techniques are proposed. In this work, the comparison of cluster DECODER, body bias DECODER, source bias DECODER, and source coupling DECODER are designed and analyzed for memory array application. Simulation is performed for the comparative analysis of different DECODER design parameters at 180 nm GPDK technology file using the CADENCE tool. Simulation results show that the proposed source bias DECODER circuit technique decreases the leakage current by 99.92% and static energy by 99.92% at a supply voltage of 1.2 V. The proposed circuit also improves dynamic power dissipation by 5.69%, dynamic PDP/EDP 65.03% and delay 57.25% at 1.2 V supply voltage.

Systolic array processing of the sequential decoding algorithm

Science.gov (United States)

Chang, C. Y.; Yao, K.

1989-01-01

A systolic array processing technique is applied to implementing the stack algorithm form of the sequential decoding algorithm. It is shown that sorting, a key function in the stack algorithm, can be efficiently realized by a special type of systolic arrays known as systolic priority queues. Compared to the stack-bucket algorithm, this approach is shown to have the advantages that the decoding always moves along the optimal path, that it has a fast and constant decoding speed and that its simple and regular hardware architecture is suitable for VLSI implementation. Three types of systolic priority queues are discussed: random access scheme, shift register scheme and ripple register scheme. The property of the entries stored in the systolic priority queue is also investigated. The results are applicable to many other basic sorting type problems.

The Phosphorylation of Ribosomal Protein in Lemna minor

Science.gov (United States)

Trewavas, A.

1973-01-01

Sterile cultures of Lemna minor have been labeled with 32P1, and the ribosomal proteins have been examined for radioactivity. In relatively short term labeling a radioactive protein was found which ran as a single component in both urea/acetic acid and sodium lauryl sulfate gel electrophoresis. Acid hydrolysis of the labeled protein permitted the isolation of serine phosphate. After labeling to equilibrium with 32P1, calculation indicated only 0.6 to 0.75 atom of this protein phosphorus per ribosome. The phosphorylated protein is found in both polysomes and “derived” monomers and appears to be located in the ribosomal small subunit. Its apparent molecular weight is 42,000. Addition of growth-inhibiting concentrations of abscisic acid does not alter the apparent degree of labeling of this protein in 5 hours, but after 24 hours of treatment the total protein phosphorus was reduced from 0.75 atom of phosphorus per ribosome to 0.36 atom of phosphorus per ribosome. PMID:16658405

Online decoding of object-based attention using real-time fMRI.

Science.gov (United States)

Niazi, Adnan M; van den Broek, Philip L C; Klanke, Stefan; Barth, Markus; Poel, Mannes; Desain, Peter; van Gerven, Marcel A J

2014-01-01

Visual attention is used to selectively filter relevant information depending on current task demands and goals. Visual attention is called object-based attention when it is directed to coherent forms or objects in the visual field. This study used real-time functional magnetic resonance imaging for moment-to-moment decoding of attention to spatially overlapped objects belonging to two different object categories. First, a whole-brain classifier was trained on pictures of faces and places. Subjects then saw transparently overlapped pictures of a face and a place, and attended to only one of them while ignoring the other. The category of the attended object, face or place, was decoded on a scan-by-scan basis using the previously trained decoder. The decoder performed at 77.6% accuracy indicating that despite competing bottom-up sensory input, object-based visual attention biased neural patterns towards that of the attended object. Furthermore, a comparison between different classification approaches indicated that the representation of faces and places is distributed rather than focal. This implies that real-time decoding of object-based attention requires a multivariate decoding approach that can detect these distributed patterns of cortical activity. © 2013 Federation of European Neuroscience Societies and John Wiley & Sons Ltd.

Multiple LDPC decoding for distributed source coding and video coding

DEFF Research Database (Denmark)

Forchhammer, Søren; Luong, Huynh Van; Huang, Xin

2011-01-01

Distributed source coding (DSC) is a coding paradigm for systems which fully or partly exploit the source statistics at the decoder to reduce the computational burden at the encoder. Distributed video coding (DVC) is one example. This paper considers the use of Low Density Parity Check Accumulate...... (LDPCA) codes in a DSC scheme with feed-back. To improve the LDPC coding performance in the context of DSC and DVC, while retaining short encoder blocks, this paper proposes multiple parallel LDPC decoding. The proposed scheme passes soft information between decoders to enhance performance. Experimental...

Partially blind instantly decodable network codes for lossy feedback environment

KAUST Repository

Sorour, Sameh; Douik, Ahmed S.; Valaee, Shahrokh; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim

2014-01-01

an expression for the expected decoding delay increment for any arbitrary transmission. This expression is then used to find the optimal policy that reduces the decoding delay in such lossy feedback environment. Results show that our proposed solutions both

A computational investigation on the connection between dynamics properties of ribosomal proteins and ribosome assembly.

Directory of Open Access Journals (Sweden)

Brittany Burton

Full Text Available Assembly of the ribosome from its protein and RNA constituents has been studied extensively over the past 50 years, and experimental evidence suggests that prokaryotic ribosomal proteins undergo conformational changes during assembly. However, to date, no studies have attempted to elucidate these conformational changes. The present work utilizes computational methods to analyze protein dynamics and to investigate the linkage between dynamics and binding of these proteins during the assembly of the ribosome. Ribosomal proteins are known to be positively charged and we find the percentage of positive residues in r-proteins to be about twice that of the average protein: Lys+Arg is 18.7% for E. coli and 21.2% for T. thermophilus. Also, positive residues constitute a large proportion of RNA contacting residues: 39% for E. coli and 46% for T. thermophilus. This affirms the known importance of charge-charge interactions in the assembly of the ribosome. We studied the dynamics of three primary proteins from E. coli and T. thermophilus 30S subunits that bind early in the assembly (S15, S17, and S20 with atomic molecular dynamic simulations, followed by a study of all r-proteins using elastic network models. Molecular dynamics simulations show that solvent-exposed proteins (S15 and S17 tend to adopt more stable solution conformations than an RNA-embedded protein (S20. We also find protein residues that contact the 16S rRNA are generally more mobile in comparison with the other residues. This is because there is a larger proportion of contacting residues located in flexible loop regions. By the use of elastic network models, which are computationally more efficient, we show that this trend holds for most of the 30S r-proteins.

Phosphorylation of acidic ribosomal proteins from rabbit reticulocytes by a ribosome-associated casein kinase

DEFF Research Database (Denmark)

Issinger, O G

1977-01-01

Two acidic proteins from 80-S ribosomes were isolated and purified to homogeneity. The purified acidic proteins could be phosphorylated by casein kinase using [gamma-32P]ATP and [gamma-32P]GTP as a phosphoryl donor. The proteins became phosphorylated in situ, too. Sodium dodecyl sulfate polyacryl......Two acidic proteins from 80-S ribosomes were isolated and purified to homogeneity. The purified acidic proteins could be phosphorylated by casein kinase using [gamma-32P]ATP and [gamma-32P]GTP as a phosphoryl donor. The proteins became phosphorylated in situ, too. Sodium dodecyl sulfate...

On the control of ribosomal protein biosynthesis in Escherichia coli

International Nuclear Information System (INIS)

Pichon, J.; Marvaldi, J.; Coeroli, C.; Cozzone, A.; Marchis-Mouren, G.

1977-01-01

The rate of individual ribosomal protein synthesis relative to total protein synthesis has been determined in Escherichia coli rel + and rel - cells, under valyl-tRNA deprivation. These strains have a temperature-sensitive valyl-tRNA synthetase. Starvation was obtained following transfer of the cells to non-permissive temperature. Ribosomal proteins were obtained by treatment of either total lysates of freeze-thawed lysozyme spheroplasts or ammonium sulphate precipitate of ribosomes, with acetic acid. Differential labelling of the ribosomal proteins was observed in both strains: proteins from the rel + strain appear more labelled than those from the rel - strain, the rate of labelling of individual proteins being about the same in both strains. Moreover ribosomal proteins were found as stable during starvation as total protein. It is thus concluded that in starving cells individual ribosomal proteins are not synthesized at equal rates. This indicates that the synthesis of ribosomal proteins is not only under the control of the rel gene

VLSI Architectures for Sliding-Window-Based Space-Time Turbo Trellis Code Decoders

Directory of Open Access Journals (Sweden)

Georgios Passas

2012-01-01

Full Text Available The VLSI implementation of SISO-MAP decoders used for traditional iterative turbo coding has been investigated in the literature. In this paper, a complete architectural model of a space-time turbo code receiver that includes elementary decoders is presented. These architectures are based on newly proposed building blocks such as a recursive add-compare-select-offset (ACSO unit, A-, B-, Γ-, and LLR output calculation modules. Measurements of complexity and decoding delay of several sliding-window-technique-based MAP decoder architectures and a proposed parameter set lead to defining equations and comparison between those architectures.

Decoding English Alphabet Letters Using EEG Phase Information

Directory of Open Access Journals (Sweden)

YiYan Wang

2018-02-01

Full Text Available Increasing evidence indicates that the phase pattern and power of the low frequency oscillations of brain electroencephalograms (EEG contain significant information during the human cognition of sensory signals such as auditory and visual stimuli. Here, we investigate whether and how the letters of the alphabet can be directly decoded from EEG phase and power data. In addition, we investigate how different band oscillations contribute to the classification and determine the critical time periods. An English letter recognition task was assigned, and statistical analyses were conducted to decode the EEG signal corresponding to each letter visualized on a computer screen. We applied support vector machine (SVM with gradient descent method to learn the potential features for classification. It was observed that the EEG phase signals have a higher decoding accuracy than the oscillation power information. Low-frequency theta and alpha oscillations have phase information with higher accuracy than do other bands. The decoding performance was best when the analysis period began from 180 to 380 ms after stimulus presentation, especially in the lateral occipital and posterior temporal scalp regions (PO7 and PO8. These results may provide a new approach for brain-computer interface techniques (BCI and may deepen our understanding of EEG oscillations in cognition.

Multi-Trial Guruswami–Sudan Decoding for Generalised Reed–Solomon Codes

DEFF Research Database (Denmark)

Nielsen, Johan Sebastian Rosenkilde; Zeh, Alexander

2013-01-01

An iterated refinement procedure for the Guruswami–Sudan list decoding algorithm for Generalised Reed–Solomon codes based on Alekhnovich’s module minimisation is proposed. The method is parametrisable and allows variants of the usual list decoding approach. In particular, finding the list...

Decoding Interleaved Gabidulin Codes using Alekhnovich's Algorithm

DEFF Research Database (Denmark)

Puchinger, Sven; Müelich, Sven; Mödinger, David

2017-01-01

We prove that Alekhnovich's algorithm can be used for row reduction of skew polynomial matrices. This yields an O(ℓ3n(ω+1)/2log⁡(n)) decoding algorithm for ℓ-Interleaved Gabidulin codes of length n, where ω is the matrix multiplication exponent.......We prove that Alekhnovich's algorithm can be used for row reduction of skew polynomial matrices. This yields an O(ℓ3n(ω+1)/2log⁡(n)) decoding algorithm for ℓ-Interleaved Gabidulin codes of length n, where ω is the matrix multiplication exponent....

Decoding LDPC Convolutional Codes on Markov Channels

Directory of Open Access Journals (Sweden)

Kashyap Manohar

2008-01-01

Full Text Available Abstract This paper describes a pipelined iterative technique for joint decoding and channel state estimation of LDPC convolutional codes over Markov channels. Example designs are presented for the Gilbert-Elliott discrete channel model. We also compare the performance and complexity of our algorithm against joint decoding and state estimation of conventional LDPC block codes. Complexity analysis reveals that our pipelined algorithm reduces the number of operations per time step compared to LDPC block codes, at the expense of increased memory and latency. This tradeoff is favorable for low-power applications.

Decoding LDPC Convolutional Codes on Markov Channels

Directory of Open Access Journals (Sweden)

Chris Winstead

2008-04-01

Full Text Available This paper describes a pipelined iterative technique for joint decoding and channel state estimation of LDPC convolutional codes over Markov channels. Example designs are presented for the Gilbert-Elliott discrete channel model. We also compare the performance and complexity of our algorithm against joint decoding and state estimation of conventional LDPC block codes. Complexity analysis reveals that our pipelined algorithm reduces the number of operations per time step compared to LDPC block codes, at the expense of increased memory and latency. This tradeoff is favorable for low-power applications.

Toward a universal decoder of linguistic meaning from brain activation.

Science.gov (United States)

Pereira, Francisco; Lou, Bin; Pritchett, Brianna; Ritter, Samuel; Gershman, Samuel J; Kanwisher, Nancy; Botvinick, Matthew; Fedorenko, Evelina

2018-03-06

Prior work decoding linguistic meaning from imaging data has been largely limited to concrete nouns, using similar stimuli for training and testing, from a relatively small number of semantic categories. Here we present a new approach for building a brain decoding system in which words and sentences are represented as vectors in a semantic space constructed from massive text corpora. By efficiently sampling this space to select training stimuli shown to subjects, we maximize the ability to generalize to new meanings from limited imaging data. To validate this approach, we train the system on imaging data of individual concepts, and show it can decode semantic vector representations from imaging data of sentences about a wide variety of both concrete and abstract topics from two separate datasets. These decoded representations are sufficiently detailed to distinguish even semantically similar sentences, and to capture the similarity structure of meaning relationships between sentences.

In Profile: Models of Ribosome Biogenesis Defects and Regulation of Protein Synthesis

NARCIS (Netherlands)

Essers, P.B.M.

2013-01-01

Ribosomes are the mediators of protein synthesis in the cell and therefore crucial to proper cell function. In addition, ribosomes are highly abundant, with ribosomal RNA making up 80% of the RNA in the cell. A large amount of resources go into maintaining this pool of ribosomes, so ribosome

The primary structures of ribosomal proteins S14 and S16 from the archaebacterium Halobacterium marismortui. Comparison with eubacterial and eukaryotic ribosomal proteins.

Science.gov (United States)

Kimura, J; Kimura, M

1987-09-05

The amino acid sequences of two ribosomal proteins, S14 and S16, from the archaebacterium Halobacterium marismortui have been determined. Sequence data were obtained by the manual and solid-phase sequencing of peptides derived from enzymatic digestions with trypsin, chymotrypsin, pepsin, and Staphylococcus aureus protease as well as by chemical cleavage with cyanogen bromide. Proteins S14 and S16 contain 109 and 126 amino acid residues and have Mr values of 11,964 and 13,515, respectively. Comparison of the sequences with those of ribosomal proteins from other organisms demonstrates that S14 has a significant homology with the rat liver ribosomal protein S11 (36% identity) as well as with the Escherichia coli ribosomal protein S17 (37%), and that S16 is related to the yeast ribosomal protein YS22 (40%) and proteins S8 from E. coli (28%) and Bacillus stearothermophilus (30%). A comparison of the amino acid residues in the homologous regions of halophilic and nonhalophilic ribosomal proteins reveals that halophilic proteins have more glutamic acids, asparatic acids, prolines, and alanines, and less lysines, arginines, and isoleucines than their nonhalophilic counterparts. These amino acid substitutions probably contribute to the structural stability of halophilic ribosomal proteins.

An overview of turbo decoding on fading channels

OpenAIRE

ATILGAN, Doğan

2009-01-01

A review of turbo coding and decoding has been presented in the literature [1]. In that paper, turbo coding and decoding on AWGN (Additive White Gaussian Noise) channels has been elaborated. In wireless communications, a phenomennon called multipath fading is frequently encountered. Therefore, investigation of efficient techniques to tackle with the destructive effects of fading is essential. Turbo coding has been proven as an efficient channel coding technique for AWGN channels. Some of the ...

Vectorization of Reed Solomon decoding and mapping on the EVP

NARCIS (Netherlands)

Kumar, A.; Berkel, van C.H.

2008-01-01

Reed Solomon (RS) codes are used in a variety of (wireless) communication systems. Although commonly implemented in dedicated hardware, this paper explores the mapping of high-throughput RS decoding on vector DSPs. The four modules of such a decoder, viz. Syndrome Computation, Key Equation Solver,

Probabilistic Amplitude Shaping With Hard Decision Decoding and Staircase Codes

Science.gov (United States)

Sheikh, Alireza; Amat, Alexandre Graell i.; Liva, Gianluigi; Steiner, Fabian

2018-05-01

We consider probabilistic amplitude shaping (PAS) as a means of increasing the spectral efficiency of fiber-optic communication systems. In contrast to previous works in the literature, we consider probabilistic shaping with hard decision decoding (HDD). In particular, we apply the PAS recently introduced by B\\"ocherer \\emph{et al.} to a coded modulation (CM) scheme with bit-wise HDD that uses a staircase code as the forward error correction code. We show that the CM scheme with PAS and staircase codes yields significant gains in spectral efficiency with respect to the baseline scheme using a staircase code and a standard constellation with uniformly distributed signal points. Using a single staircase code, the proposed scheme achieves performance within $0.57$--$1.44$ dB of the corresponding achievable information rate for a wide range of spectral efficiencies.

Optical LDPC decoders for beyond 100 Gbits/s optical transmission.

Science.gov (United States)

Djordjevic, Ivan B; Xu, Lei; Wang, Ting

2009-05-01

We present an optical low-density parity-check (LDPC) decoder suitable for implementation above 100 Gbits/s, which provides large coding gains when based on large-girth LDPC codes. We show that a basic building block, the probabilities multiplier circuit, can be implemented using a Mach-Zehnder interferometer, and we propose corresponding probabilistic-domain sum-product algorithm (SPA). We perform simulations of a fully parallel implementation employing girth-10 LDPC codes and proposed SPA. The girth-10 LDPC(24015,19212) code of the rate of 0.8 outperforms the BCH(128,113)xBCH(256,239) turbo-product code of the rate of 0.82 by 0.91 dB (for binary phase-shift keying at 100 Gbits/s and a bit error rate of 10(-9)), and provides a net effective coding gain of 10.09 dB.

Efficient decoding with steady-state Kalman filter in neural interface systems.

Science.gov (United States)

Malik, Wasim Q; Truccolo, Wilson; Brown, Emery N; Hochberg, Leigh R

2011-02-01

The Kalman filter is commonly used in neural interface systems to decode neural activity and estimate the desired movement kinematics. We analyze a low-complexity Kalman filter implementation in which the filter gain is approximated by its steady-state form, computed offline before real-time decoding commences. We evaluate its performance using human motor cortical spike train data obtained from an intracortical recording array as part of an ongoing pilot clinical trial. We demonstrate that the standard Kalman filter gain converges to within 95% of the steady-state filter gain in 1.5±0.5 s (mean ±s.d.). The difference in the intended movement velocity decoded by the two filters vanishes within 5 s, with a correlation coefficient of 0.99 between the two decoded velocities over the session length. We also find that the steady-state Kalman filter reduces the computational load (algorithm execution time) for decoding the firing rates of 25±3 single units by a factor of 7.0±0.9. We expect that the gain in computational efficiency will be much higher in systems with larger neural ensembles. The steady-state filter can thus provide substantial runtime efficiency at little cost in terms of estimation accuracy. This far more efficient neural decoding approach will facilitate the practical implementation of future large-dimensional, multisignal neural interface systems.

Hypoxic stress-induced changes in ribosomes of maize seedling roots

International Nuclear Information System (INIS)

Bailey-Serres, J.; Freeling, M.

1990-01-01

The hypoxic stress response of Zea mays L. seedling roots involves regulation of gene expression at transcriptional and posttranscriptional levels. We investigated the effect of hypoxia on the translational machinery of seedling roots. The levels of monoribosomes and ribosomal subunits increased dramatically within 1 hour of stress. Prolonged hypoxia resulted in continued accumulation of nontranslating ribosomes, as well as increased levels of small polyribosomes. The return of seedlings to normal aerobic conditions resulted in recovery of normal polyribosome levels. Comparison of ribosomal proteins from control and hypoxic roots revealed differences in quantity and electrophoretic mobility. In vivo labeling of roots with [ 35 S]methionine revealed variations in newly synthesized ribosomal proteins. In vivo labeling of roots with [ 32 P]orthophosphate revealed a major reduction in the phosphorylation of a 31 kilodalton ribosomal protein in hypoxic stressed roots. In vitro phosphorylation of ribosomal proteins by endogenous kinases was used to probe for differences in ribosome structure and composition. The patterns of in vitro kinased phosphoproteins of ribosomes from control and hypoxic roots were not identical. Variation in phosphoproteins of polyribosomes from control and hypoxic roots, as well as among polyribosomes from hypoxic roots were observed. These results indicate that modification of the translational machinery occurs in response to hypoxic stress

Ribosomes slide on lysine-encoding homopolymeric A stretches

Science.gov (United States)

Koutmou, Kristin S; Schuller, Anthony P; Brunelle, Julie L; Radhakrishnan, Aditya; Djuranovic, Sergej; Green, Rachel

2015-01-01

Protein output from synonymous codons is thought to be equivalent if appropriate tRNAs are sufficiently abundant. Here we show that mRNAs encoding iterated lysine codons, AAA or AAG, differentially impact protein synthesis: insertion of iterated AAA codons into an ORF diminishes protein expression more than insertion of synonymous AAG codons. Kinetic studies in E. coli reveal that differential protein production results from pausing on consecutive AAA-lysines followed by ribosome sliding on homopolymeric A sequence. Translation in a cell-free expression system demonstrates that diminished output from AAA-codon-containing reporters results from premature translation termination on out of frame stop codons following ribosome sliding. In eukaryotes, these premature termination events target the mRNAs for Nonsense-Mediated-Decay (NMD). The finding that ribosomes slide on homopolymeric A sequences explains bioinformatic analyses indicating that consecutive AAA codons are under-represented in gene-coding sequences. Ribosome ‘sliding’ represents an unexpected type of ribosome movement possible during translation. DOI: http://dx.doi.org/10.7554/eLife.05534.001 PMID:25695637

PERFORMANCE EVALUATION OF TURBO CODED OFDM SYSTEMS AND APPLICATION OF TURBO DECODING FOR IMPULSIVE CHANNEL

Directory of Open Access Journals (Sweden)

Savitha H. M.

2010-09-01

Full Text Available A comparison of the performance of hard and soft-decision turbo coded Orthogonal Frequency Division Multiplexing systems with Quadrature Phase Shift Keying (QPSK and 16-Quadrature Amplitude Modulation (16-QAM is considered in the first section of this paper. The results show that the soft-decision method greatly outperforms the hard-decision method. The complexity of the demapper is reduced with the use of simplified algorithm for 16-QAM demapping. In the later part of the paper, we consider the transmission of data over additive white class A noise (AWAN channel, using turbo coded QPSK and 16-QAM systems. We propose a novel turbo decoding scheme for AWAN channel. Also we compare the performance of turbo coded systems with QPSK and 16-QAM on AWAN channel with two different channel values- one computed as per additive white Gaussian noise (AWGN channel conditions and the other as per AWAN channel conditions. The results show that the use of appropriate channel value in turbo decoding helps to combat the impulsive noise more effectively. The proposed model for AWAN channel exhibits comparable Bit error rate (BER performance as compared to AWGN channel.

Log-Likelihood Ratio Calculation for Iterative Decoding on Rayleigh Fading Channels Using Padé Approximation

Directory of Open Access Journals (Sweden)

Gou Hosoya

2013-01-01

Full Text Available Approximate calculation of channel log-likelihood ratio (LLR for wireless channels using Padé approximation is presented. LLR is used as an input of iterative decoding for powerful error-correcting codes such as low-density parity-check (LDPC codes or turbo codes. Due to the lack of knowledge of the channel state information of a wireless fading channel, such as uncorrelated fiat Rayleigh fading channels, calculations of exact LLR for these channels are quite complicated for a practical implementation. The previous work, an LLR calculation using the Taylor approximation, quickly becomes inaccurate as the channel output leaves some derivative point. This becomes a big problem when higher order modulation scheme is employed. To overcome this problem, a new LLR approximation using Padé approximation, which expresses the original function by a rational form of two polynomials with the same total number of coefficients of the Taylor series and can accelerate the Taylor approximation, is devised. By applying the proposed approximation to the iterative decoding and the LDPC codes with some modulation schemes, we show the effectiveness of the proposed methods by simulation results and analysis based on the density evolution.

Parallel iterative decoding of transform domain Wyner-Ziv video using cross bitplane correlation

DEFF Research Database (Denmark)

Luong, Huynh Van; Huang, Xin; Forchhammer, Søren

2011-01-01

decoding scheme is proposed to improve the coding efficiency of TDWZ video codecs. The proposed parallel iterative LDPC decoding scheme is able to utilize cross bitplane correlation during decoding, by iteratively refining the soft-input, updating a modeled noise distribution and thereafter enhancing......In recent years, Transform Domain Wyner-Ziv (TDWZ) video coding has been proposed as an efficient Distributed Video Coding (DVC) solution, which fully or partly exploits the source statistics at the decoder to reduce the computational burden at the encoder. In this paper, a parallel iterative LDPC...

Decoding bipedal locomotion from the rat sensorimotor cortex

Science.gov (United States)

Rigosa, J.; Panarese, A.; Dominici, N.; Friedli, L.; van den Brand, R.; Carpaneto, J.; DiGiovanna, J.; Courtine, G.; Micera, S.

2015-10-01

Objective. Decoding forelimb movements from the firing activity of cortical neurons has been interfaced with robotic and prosthetic systems to replace lost upper limb functions in humans. Despite the potential of this approach to improve locomotion and facilitate gait rehabilitation, decoding lower limb movement from the motor cortex has received comparatively little attention. Here, we performed experiments to identify the type and amount of information that can be decoded from neuronal ensemble activity in the hindlimb area of the rat motor cortex during bipedal locomotor tasks. Approach. Rats were trained to stand, step on a treadmill, walk overground and climb staircases in a bipedal posture. To impose this gait, the rats were secured in a robotic interface that provided support against the direction of gravity and in the mediolateral direction, but behaved transparently in the forward direction. After completion of training, rats were chronically implanted with a micro-wire array spanning the left hindlimb motor cortex to record single and multi-unit activity, and bipolar electrodes into 10 muscles of the right hindlimb to monitor electromyographic signals. Whole-body kinematics, muscle activity, and neural signals were simultaneously recorded during execution of the trained tasks over multiple days of testing. Hindlimb kinematics, muscle activity, gait phases, and locomotor tasks were decoded using offline classification algorithms. Main results. We found that the stance and swing phases of gait and the locomotor tasks were detected with accuracies as robust as 90% in all rats. Decoded hindlimb kinematics and muscle activity exhibited a larger variability across rats and tasks. Significance. Our study shows that the rodent motor cortex contains useful information for lower limb neuroprosthetic development. However, brain-machine interfaces estimating gait phases or locomotor behaviors, instead of continuous variables such as limb joint positions or speeds

The fast decoding of Reed-Solomon codes using Fermat theoretic transforms and continued fractions

Science.gov (United States)

Reed, I. S.; Scholtz, R. A.; Welch, L. R.; Truong, T. K.

1978-01-01

It is shown that Reed-Solomon (RS) codes can be decoded by using a fast Fourier transform (FFT) algorithm over finite fields GF(F sub n), where F sub n is a Fermat prime, and continued fractions. This new transform decoding method is simpler than the standard method for RS codes. The computing time of this new decoding algorithm in software can be faster than the standard decoding method for RS codes.

Influence of video compression on the measurement error of the television system

Science.gov (United States)

Sotnik, A. V.; Yarishev, S. N.; Korotaev, V. V.

2015-05-01

possible reducing of the digital stream. Discrete cosine transformation is most widely used among possible orthogonal transformation. Errors of television measuring systems and data compression protocols analyzed In this paper. The main characteristics of measuring systems and detected sources of their error detected. The most effective methods of video compression are determined. The influence of video compression error on television measuring systems was researched. Obtained results will increase the accuracy of the measuring systems. In television image quality measuring system reduces distortion identical distortion in analog systems and specific distortions resulting from the process of coding / decoding digital video signal and errors in the transmission channel. By the distortions associated with encoding / decoding signal include quantization noise, reducing resolution, mosaic effect, "mosquito" effect edging on sharp drops brightness, blur colors, false patterns, the effect of "dirty window" and other defects. The size of video compression algorithms used in television measuring systems based on the image encoding with intra- and inter prediction individual fragments. The process of encoding / decoding image is non-linear in space and in time, because the quality of the playback of a movie at the reception depends on the pre- and post-history of a random, from the preceding and succeeding tracks, which can lead to distortion of the inadequacy of the sub-picture and a corresponding measuring signal.

Clusterless Decoding of Position From Multiunit Activity Using A Marked Point Process Filter

Science.gov (United States)

Deng, Xinyi; Liu, Daniel F.; Kay, Kenneth; Frank, Loren M.; Eden, Uri T.

2016-01-01

Point process filters have been applied successfully to decode neural signals and track neural dynamics. Traditionally, these methods assume that multiunit spiking activity has already been correctly spike-sorted. As a result, these methods are not appropriate for situations where sorting cannot be performed with high precision such as real-time decoding for brain-computer interfaces. As the unsupervised spike-sorting problem remains unsolved, we took an alternative approach that takes advantage of recent insights about clusterless decoding. Here we present a new point process decoding algorithm that does not require multiunit signals to be sorted into individual units. We use the theory of marked point processes to construct a function that characterizes the relationship between a covariate of interest (in this case, the location of a rat on a track) and features of the spike waveforms. In our example, we use tetrode recordings, and the marks represent a four-dimensional vector of the maximum amplitudes of the spike waveform on each of the four electrodes. In general, the marks may represent any features of the spike waveform. We then use Bayes’ rule to estimate spatial location from hippocampal neural activity. We validate our approach with a simulation study and with experimental data recorded in the hippocampus of a rat moving through a linear environment. Our decoding algorithm accurately reconstructs the rat’s position from unsorted multiunit spiking activity. We then compare the quality of our decoding algorithm to that of a traditional spike-sorting and decoding algorithm. Our analyses show that the proposed decoding algorithm performs equivalently or better than algorithms based on sorted single-unit activity. These results provide a path toward accurate real-time decoding of spiking patterns that could be used to carry out content-specific manipulations of population activity in hippocampus or elsewhere in the brain. PMID:25973549

Complexity Analysis of Reed-Solomon Decoding over GF(2m without Using Syndromes

Directory of Open Access Journals (Sweden)

Zhiyuan Yan

2008-06-01

Full Text Available There has been renewed interest in decoding Reed-Solomon (RS codes without using syndromes recently. In this paper, we investigate the complexity of syndromeless decoding, and compare it to that of syndrome-based decoding. Aiming to provide guidelines to practical applications, our complexity analysis focuses on RS codes over characteristic-2 fields, for which some multiplicative FFT techniques are not applicable. Due to moderate block lengths of RS codes in practice, our analysis is complete, without big O notation. In addition to fast implementation using additive FFT techniques, we also consider direct implementation, which is still relevant for RS codes with moderate lengths. For high-rate RS codes, when compared to syndrome-based decoding algorithms, not only syndromeless decoding algorithms require more field operations regardless of implementation, but also decoder architectures based on their direct implementations have higher hardware costs and lower throughput. We also derive tighter bounds on the complexities of fast polynomial multiplications based on Cantor's approach and the fast extended Euclidean algorithm.

A lossy graph model for delay reduction in generalized instantly decodable network coding

KAUST Repository

Douik, Ahmed S.

2014-06-01

The problem of minimizing the decoding delay in Generalized instantly decodable network coding (G-IDNC) for both perfect and lossy feedback scenarios is formulated as a maximum weight clique problem over the G-IDNC graph in. In this letter, we introduce a new lossy G-IDNC graph (LG-IDNC) model to further minimize the decoding delay in lossy feedback scenarios. Whereas the G-IDNC graph represents only doubtless combinable packets, the LG-IDNC graph represents also uncertain packet combinations, arising from lossy feedback events, when the expected decoding delay of XORing them among themselves or with other certain packets is lower than that expected when sending these packets separately. We compare the decoding delay performance of LG-IDNC and G-IDNC graphs through extensive simulations. Numerical results show that our new LG-IDNC graph formulation outperforms the G-IDNC graph formulation in all lossy feedback situations and achieves significant improvement in the decoding delay especially when the feedback erasure probability is higher than the packet erasure probability. © 2012 IEEE.

Decoding Dyslexia, a Common Learning Disability

Science.gov (United States)

... if they continue to struggle. Read More "Dyslexic" Articles In Their Own Words: Dealing with Dyslexia / Decoding Dyslexia, a Common Learning Disability / What is Dyslexia? / Special Education and Research ...

A Fully Parallel VLSI-implementation of the Viterbi Decoding Algorithm

DEFF Research Database (Denmark)

Sparsø, Jens; Jørgensen, Henrik Nordtorp; Paaske, Erik

1989-01-01

In this paper we describe the implementation of a K = 7, R = 1/2 single-chip Viterbi decoder intended to operate at 10-20 Mbit/sec. We propose a general, regular and area efficient floor-plan that is also suitable for implementation of decoders for codes with different generator polynomials...

Unstable structure of ribosomal particles synthesized in. gamma. -irradiated Escherichia coli

Energy Technology Data Exchange (ETDEWEB)

Fujita, H; Morita, K [National Inst. of Radiological Sciences, Chiba (Japan)

1975-06-01

Stability of Escherichia coli ribosomes newly synthesized after ..gamma..-irradiation was compared with that of normal ribosomes. The ribosomal particles around 70-S synthesized in irradiated cells were more sensitive to digestion by pancreatic ribonuclease A. A larger number of the salt-unstable '50-S' precursor particles existed in the extract from irradiated cells than in the extract from unirradiated cells. These facts suggest that ribosomal particles, synthesized during an earlier stage in irradiated cells, maintain an incomplete structure even though they are not distinguishable from normal ribosomes by means of sucrose density-gradient centrifugation.

Label-Free Quantitation of Ribosomal Proteins from Bacillus subtilis for Antibiotic Research.

Science.gov (United States)

Schäkermann, Sina; Prochnow, Pascal; Bandow, Julia E

2017-01-01

Current research is focusing on ribosome heterogeneity as a response to changing environmental conditions and stresses, such as antibiotic stress. Altered stoichiometry and composition of ribosomal proteins as well as association of additional protein factors are mechanisms for shaping the protein expression profile or hibernating ribosomes. Here, we present a method for the isolation of ribosomes to analyze antibiotic-induced changes in the composition of ribosomes in Bacillus subtilis or other bacteria. Ribosomes and associated proteins are isolated by ultracentrifugation and proteins are identified and quantified using label-free mass spectrometry.

Word Decoding Development during Phonics Instruction in Children at Risk for Dyslexia.

Science.gov (United States)

Schaars, Moniek M H; Segers, Eliane; Verhoeven, Ludo

2017-05-01

In the present study, we examined the early word decoding development of 73 children at genetic risk of dyslexia and 73 matched controls. We conducted monthly curriculum-embedded word decoding measures during the first 5 months of phonics-based reading instruction followed by standardized word decoding measures halfway and by the end of first grade. In kindergarten, vocabulary, phonological awareness, lexical retrieval, and verbal and visual short-term memory were assessed. The results showed that the children at risk were less skilled in phonemic awareness in kindergarten. During the first 5 months of reading instruction, children at risk were less efficient in word decoding and the discrepancy increased over the months. In subsequent months, the discrepancy prevailed for simple words but increased for more complex words. Phonemic awareness and lexical retrieval predicted the reading development in children at risk and controls to the same extent. It is concluded that children at risk are behind their typical peers in word decoding development starting from the very beginning. Furthermore, it is concluded that the disadvantage increased during phonics instruction and that the same predictors underlie the development of word decoding in the two groups of children. Copyright © 2017 John Wiley & Sons, Ltd. Copyright © 2017 John Wiley & Sons, Ltd.

A comparative study of ribosomal proteins: linkage between amino acid distribution and ribosomal assembly

International Nuclear Information System (INIS)

Lott, Brittany Burton; Wang, Yongmei; Nakazato, Takuya

2013-01-01

Assembly of the ribosome from its protein and RNA constituents must occur quickly and efficiently in order to synthesize the proteins necessary for all cellular activity. Since the early 1960’s, certain characteristics of possible assembly pathways have been elucidated, yet the mechanisms that govern the precise recognition events remain unclear. We utilize a comparative analysis to investigate the amino acid composition of ribosomal proteins (r-proteins) with respect to their role in the assembly process. We compared small subunit (30S) r-protein sequences to those of other housekeeping proteins from 560 bacterial species and searched for correlations between r-protein amino acid content and factors such as assembly binding order, environmental growth temperature, protein size, and contact with ribosomal RNA (rRNA) in the 30S complex. We find r-proteins have a significantly high percent of positive residues, which are highly represented at rRNA contact sites. An inverse correlation between the percent of positive residues and r-protein size was identified and is mainly due to the content of Lysine residues, rather than Arginine. Nearly all r-proteins carry a net positive charge, but no statistical correlation between the net charge and the binding order was detected. Thermophilic (high-temperature) r-proteins contain increased Arginine, Isoleucine, and Tyrosine, and decreased Serine and Threonine compared to mesophilic (lower-temperature), reflecting a known distinction between thermophiles and mesophiles, possibly to account for protein thermostability. However, this difference in amino acid content does not extend to rRNA contact sites, as the proportions of thermophilic and mesophilic contact residues are not significantly different. Given the significantly higher level of positively charged residues in r-proteins and at contact sites, we conclude that ribosome assembly relies heavily on an electrostatic component of interaction. However, the binding order of

Min-Max decoding for non binary LDPC codes

OpenAIRE

Savin, Valentin

2008-01-01

Iterative decoding of non-binary LDPC codes is currently performed using either the Sum-Product or the Min-Sum algorithms or slightly different versions of them. In this paper, several low-complexity quasi-optimal iterative algorithms are proposed for decoding non-binary codes. The Min-Max algorithm is one of them and it has the benefit of two possible LLR domain implementations: a standard implementation, whose complexity scales as the square of the Galois field's cardinality and a reduced c...

Selection combining for noncoherent decode-and-forward relay networks

Directory of Open Access Journals (Sweden)

Nguyen Ha

2011-01-01

Full Text Available Abstract This paper studies a new decode-and-forward relaying scheme for a cooperative wireless network composed of one source, K relays, and one destination and with binary frequency-shift keying modulation. A single threshold is employed to select retransmitting relays as follows: a relay retransmits to the destination if its decision variable is larger than the threshold; otherwise, it remains silent. The destination then performs selection combining for the detection of transmitted information. The average end-to-end bit-error-rate (BER is analytically determined in a closed-form expression. Based on the derived BER, the problem of choosing an optimal threshold or jointly optimal threshold and power allocation to minimize the end-to-end BER is also investigated. Both analytical and simulation results reveal that the obtained optimal threshold scheme or jointly optimal threshold and power-allocation scheme can significantly improve the BER performance compared to a previously proposed scheme.

Architecture of the large subunit of the mammalian mitochondrial ribosome.

Science.gov (United States)

Greber, Basil J; Boehringer, Daniel; Leitner, Alexander; Bieri, Philipp; Voigts-Hoffmann, Felix; Erzberger, Jan P; Leibundgut, Marc; Aebersold, Ruedi; Ban, Nenad

2014-01-23

Mitochondrial ribosomes synthesize a number of highly hydrophobic proteins encoded on the genome of mitochondria, the organelles in eukaryotic cells that are responsible for energy conversion by oxidative phosphorylation. The ribosomes in mammalian mitochondria have undergone massive structural changes throughout their evolution, including ribosomal RNA shortening and acquisition of mitochondria-specific ribosomal proteins. Here we present the three-dimensional structure of the 39S large subunit of the porcine mitochondrial ribosome determined by cryo-electron microscopy at 4.9 Å resolution. The structure, combined with data from chemical crosslinking and mass spectrometry experiments, reveals the unique features of the 39S subunit at near-atomic resolution and provides detailed insight into the architecture of the polypeptide exit site. This region of the mitochondrial ribosome has been considerably remodelled compared to its bacterial counterpart, providing a specialized platform for the synthesis and membrane insertion of the highly hydrophobic protein components of the respiratory chain.

Decoding Codes on Graphs

Indian Academy of Sciences (India)

Shannon limit of the channel. Among the earliest discovered codes that approach the. Shannon limit were the low density parity check (LDPC) codes. The term low density arises from the property of the parity check matrix defining the code. We will now define this matrix and the role that it plays in decoding. 2. Linear Codes.

Hierarchical recruitment of ribosomal proteins and assembly factors remodels nucleolar pre-60S ribosomes.

Science.gov (United States)

Biedka, Stephanie; Micic, Jelena; Wilson, Daniel; Brown, Hailey; Diorio-Toth, Luke; Woolford, John L

2018-04-24

Ribosome biogenesis involves numerous preribosomal RNA (pre-rRNA) processing events to remove internal and external transcribed spacer sequences, ultimately yielding three mature rRNAs. Removal of the internal transcribed spacer 2 spacer RNA is the final step in large subunit pre-rRNA processing and begins with endonucleolytic cleavage at the C 2 site of 27SB pre-rRNA. C 2 cleavage requires the hierarchical recruitment of 11 ribosomal proteins and 14 ribosome assembly factors. However, the function of these proteins in C 2 cleavage remained unclear. In this study, we have performed a detailed analysis of the effects of depleting proteins required for C 2 cleavage and interpreted these results using cryo-electron microscopy structures of assembling 60S subunits. This work revealed that these proteins are required for remodeling of several neighborhoods, including two major functional centers of the 60S subunit, suggesting that these remodeling events form a checkpoint leading to C 2 cleavage. Interestingly, when C 2 cleavage is directly blocked by depleting or inactivating the C 2 endonuclease, assembly progresses through all other subsequent steps. © 2018 Biedka et al.

gamma. radiation effect on the functional properties of the cotton ribosomes

Energy Technology Data Exchange (ETDEWEB)

Ibragimov, A P; Safarov, Sh

1973-01-01

A study is made of the action of radiation on the functional properties of ribosomes in irradiated organisms and on isolated ribosomes exposed to different doses. With increase in dose there occurs a reduction in the incorporation of labelled amino acids by the ribosomes released from irradiated sprouts and also during irradiation of isolated ribosomes. The study covered the functional activity of ribosomes irradiated at different doses with the use of synthetic poly-U and poly-A matrices synthesizing polyphenylalanine and polylysine, depending on the irradiation dose. The inhibition of the activity of the protein synthesis system at high doses is due to structural and functional changes in ribosomes and also to disturbance in the biosynthesis and functions of the messenger RNA.

Ribosome•RelA structures reveal the mechanism of stringent response activation

Science.gov (United States)

Loveland, Anna B; Bah, Eugene; Madireddy, Rohini; Zhang, Ying; Brilot, Axel F; Grigorieff, Nikolaus; Korostelev, Andrei A

2016-01-01

Stringent response is a conserved bacterial stress response underlying virulence and antibiotic resistance. RelA/SpoT-homolog proteins synthesize transcriptional modulators (p)ppGpp, allowing bacteria to adapt to stress. RelA is activated during amino-acid starvation, when cognate deacyl-tRNA binds to the ribosomal A (aminoacyl-tRNA) site. We report four cryo-EM structures of E. coli RelA bound to the 70S ribosome, in the absence and presence of deacyl-tRNA accommodating in the 30S A site. The boomerang-shaped RelA with a wingspan of more than 100 Å wraps around the A/R (30S A-site/RelA-bound) tRNA. The CCA end of the A/R tRNA pins the central TGS domain against the 30S subunit, presenting the (p)ppGpp-synthetase domain near the 30S spur. The ribosome and A/R tRNA are captured in three conformations, revealing hitherto elusive states of tRNA engagement with the ribosomal decoding center. Decoding-center rearrangements are coupled with the step-wise 30S-subunit 'closure', providing insights into the dynamics of high-fidelity tRNA decoding. DOI: http://dx.doi.org/10.7554/eLife.17029.001 PMID:27434674

Interaction of tRNA with Eukaryotic Ribosome

Directory of Open Access Journals (Sweden)

Dmitri Graifer

2015-03-01

Full Text Available This paper is a review of currently available data concerning interactions of tRNAs with the eukaryotic ribosome at various stages of translation. These data include the results obtained by means of cryo-electron microscopy and X-ray crystallography applied to various model ribosomal complexes, site-directed cross-linking with the use of tRNA derivatives bearing chemically or photochemically reactive groups in the CCA-terminal fragment and chemical probing of 28S rRNA in the region of the peptidyl transferase center. Similarities and differences in the interactions of tRNAs with prokaryotic and eukaryotic ribosomes are discussed with concomitant consideration of the extent of resemblance between molecular mechanisms of translation in eukaryotes and bacteria.

Prior Knowledge Improves Decoding of Finger Flexion from Electrocorticographic (ECoG Signals

Directory of Open Access Journals (Sweden)

Zuoguan eWang

2011-11-01

Full Text Available Brain-computer interfaces (BCIs use brain signals to convey a user's intent. Some BCI approaches begin by decoding kinematic parameters of movements from brain signals, and then proceed to using these signals, in absence of movements, to allow a user to control an output. Recent results have shown that electrocorticographic (ECoG recordings from the surface of the brain in humans can give information about kinematic parameters (eg{} hand velocity or finger flexion. The decoding approaches in these studies usually employed classical classification/regression algorithms that derive a linear mapping between brain signals and outputs. However, they typically only incorporate little prior information about the target movement parameter. In this paper, we incorporate prior knowledge using a Bayesian decoding method, and use it to decode finger flexion from ECoG signals. Specifically, we exploit the anatomic constraints and dynamic constraints that govern finger flexion and incorporate these constraints in the construction, structure, and the probabilistic functions of the prior model of a switched non-parametric dynamic system (SNDS. Given a measurement model resulting from a traditional linear regression method, we decoded finger flexion using posterior estimation that combined the prior and measurement models. Our results show that the application of the Bayesian decoding model, which incorporates prior knowledge, improves decoding performance compared to the application of a linear regression model, which does not incorporate prior knowledge. Thus, the results presented in this paper may ultimately lead to neurally controlled hand prostheses with full fine-grained finger articulation.

Role of Gender and Linguistic Diversity in Word Decoding Development

Science.gov (United States)

Verhoeven, Ludo; van Leeuwe, Jan

2011-01-01

The purpose of the present study was to investigate the role of gender and linguistic diversity in the growth of Dutch word decoding skills throughout elementary school for a representative sample of children living in the Netherlands. Following a longitudinal design, the children's decoding abilities for (1) regular CVC words, (2) complex…

The highly conserved codon following the slippery sequence supports -1 frameshift efficiency at the HIV-1 frameshift site.

Directory of Open Access Journals (Sweden)

Suneeth F Mathew

Full Text Available HIV-1 utilises -1 programmed ribosomal frameshifting to translate structural and enzymatic domains in a defined proportion required for replication. A slippery sequence, U UUU UUA, and a stem-loop are well-defined RNA features modulating -1 frameshifting in HIV-1. The GGG glycine codon immediately following the slippery sequence (the 'intercodon' contributes structurally to the start of the stem-loop but has no defined role in current models of the frameshift mechanism, as slippage is inferred to occur before the intercodon has reached the ribosomal decoding site. This GGG codon is highly conserved in natural isolates of HIV. When the natural intercodon was replaced with a stop codon two different decoding molecules-eRF1 protein or a cognate suppressor tRNA-were able to access and decode the intercodon prior to -1 frameshifting. This implies significant slippage occurs when the intercodon is in the (perhaps distorted ribosomal A site. We accommodate the influence of the intercodon in a model of frame maintenance versus frameshifting in HIV-1.

Macrolide antibiotic interaction and resistance on the bacterial ribosome.

Science.gov (United States)

Poehlsgaard, Jacob; Douthwaite, Stephen

2003-02-01

Our understanding of the fine structure of many antibiotic target sites has reached a new level of enlightenment in the last couple of years due to the advent, by X-ray crystallography, of high-resolution structures of the bacterial ribosome. Many classes of clinically useful antibiotics bind to the ribosome to inhibit bacterial protein synthesis. Macrolide, lincosamide and streptogramin B (MLSB) antibiotics form one of the largest groups, and bind to the same site on the 50S ribosomal subunit. Here, we review the molecular details of the ribosomal MLSB site to put into perspective the main points from a wealth of biochemical and genetic data that have been collected over several decades. The information is now available to understand, at atomic resolution, how macrolide antibiotics interact with their ribosomal target, how the target is altered to confer resistance, and in which directions we need to look if we are to rationally design better drugs to overcome the extant resistance mechanisms.

Cis-regulatory RNA elements that regulate specialized ribosome activity.

Science.gov (United States)

Xue, Shifeng; Barna, Maria

2015-01-01

Recent evidence has shown that the ribosome itself can play a highly regulatory role in the specialized translation of specific subpools of mRNAs, in particular at the level of ribosomal proteins (RP). However, the mechanism(s) by which this selection takes place has remained poorly understood. In our recent study, we discovered a combination of unique RNA elements in the 5'UTRs of mRNAs that allows for such control by the ribosome. These mRNAs contain a Translation Inhibitory Element (TIE) that inhibits general cap-dependent translation, and an Internal Ribosome Entry Site (IRES) that relies on a specific RP for activation. The unique combination of an inhibitor of general translation and an activator of specialized translation is key to ribosome-mediated control of gene expression. Here we discuss how these RNA regulatory elements provide a new level of control to protein expression and their implications for gene expression, organismal development and evolution.

Yeast ribosomal proteins

International Nuclear Information System (INIS)

Otaka, E.; Kobata, K.

1978-01-01

The cytoplasmic 80s ribosomal proteins from the cells of yeast Saccharomyces cerevisiae were analyzed by SDS two-dimensional polyacrylamide gel electrophoresis. Seventyfour proteins were identified and consecutively numbered from 1 to 74. Upon oxidation of the 80s proteins with performic acid, ten proteins (no. 15, 20, 35, 40, 44, 46, 49, 51, 54 and 55) were dislocated on the gel without change of the total number of protein spots. Five proteins (no. 8, 14, 16, 36 and 74) were phosphorylated in vivo as seen in 32 P-labelling experiments. The large and small subunits separated in low magnesium medium were analyzed by the above gel electrophoresis. At least forty-five and twenty-eight proteins were assumed to be in the large and small subunits, respectively. All proteins found in the 80s ribosomes, except for no. 3, were detected in either subunit without appearance of new spots. The acidic protein no. 3 seems to be lost during subunit dissociation. (orig.) [de

A bidirectional brain-machine interface featuring a neuromorphic hardware decoder

Directory of Open Access Journals (Sweden)

Fabio Boi

2016-12-01

Full Text Available Bidirectional brain-machine interfaces (BMIs establish a two-way direct communication link4 between the brain and the external world. A decoder translates recorded neural activity into motor5 commands and an encoder delivers sensory information collected from the environment directly6 to the brain creating a closed-loop system. These two modules are typically integrated in bulky7 external devices. However, the clinical support of patients with severe motor and sensory deficits8 requires compact, low-power, and fully implantable systems that can decode neural signals to9 control external devices. As a first step toward this goal, we developed a modular bidirectional BMI10 setup that uses a compact neuromorphic processor as a decoder. On this chip we implemented11 a network of spiking neurons built using its ultra-low-power mixed-signal analog/digital circuits.12 On-chip on-line spike-timing-dependent plasticity synapse circuits enabled the network to learn13 to decode neural signals recorded from the brain into motor outputs controlling the movements14 of an external device. The modularity of the BMI allowed us to tune the individual components15 of the setup without modifying the whole system. In this paper we present the features of16 this modular BMI, and describe how we configured the network of spiking neuron circuits to17 implement the decoder and to coordinate it with the encoder in an experimental BMI paradigm18 that connects bidirectionally the brain of an anesthetized rat with an external object. We show that19 the chip learned the decoding task correctly, allowing the interfaced brain to control the object’s20 trajectories robustly. Based on our demonstration, we propose that neuromorphic technology is21 mature enough for the development of BMI modules that are sufficiently low-power and compact,22 while being highly computationally powerful and adaptive.

A Bidirectional Brain-Machine Interface Featuring a Neuromorphic Hardware Decoder.

Science.gov (United States)

Boi, Fabio; Moraitis, Timoleon; De Feo, Vito; Diotalevi, Francesco; Bartolozzi, Chiara; Indiveri, Giacomo; Vato, Alessandro

2016-01-01

Bidirectional brain-machine interfaces (BMIs) establish a two-way direct communication link between the brain and the external world. A decoder translates recorded neural activity into motor commands and an encoder delivers sensory information collected from the environment directly to the brain creating a closed-loop system. These two modules are typically integrated in bulky external devices. However, the clinical support of patients with severe motor and sensory deficits requires compact, low-power, and fully implantable systems that can decode neural signals to control external devices. As a first step toward this goal, we developed a modular bidirectional BMI setup that uses a compact neuromorphic processor as a decoder. On this chip we implemented a network of spiking neurons built using its ultra-low-power mixed-signal analog/digital circuits. On-chip on-line spike-timing-dependent plasticity synapse circuits enabled the network to learn to decode neural signals recorded from the brain into motor outputs controlling the movements of an external device. The modularity of the BMI allowed us to tune the individual components of the setup without modifying the whole system. In this paper, we present the features of this modular BMI and describe how we configured the network of spiking neuron circuits to implement the decoder and to coordinate it with the encoder in an experimental BMI paradigm that connects bidirectionally the brain of an anesthetized rat with an external object. We show that the chip learned the decoding task correctly, allowing the interfaced brain to control the object's trajectories robustly. Based on our demonstration, we propose that neuromorphic technology is mature enough for the development of BMI modules that are sufficiently low-power and compact, while being highly computationally powerful and adaptive.

Peeling Decoding of LDPC Codes with Applications in Compressed Sensing

Directory of Open Access Journals (Sweden)

Weijun Zeng

2016-01-01

Full Text Available We present a new approach for the analysis of iterative peeling decoding recovery algorithms in the context of Low-Density Parity-Check (LDPC codes and compressed sensing. The iterative recovery algorithm is particularly interesting for its low measurement cost and low computational complexity. The asymptotic analysis can track the evolution of the fraction of unrecovered signal elements in each iteration, which is similar to the well-known density evolution analysis in the context of LDPC decoding algorithm. Our analysis shows that there exists a threshold on the density factor; if under this threshold, the recovery algorithm is successful; otherwise it will fail. Simulation results are also provided for verifying the agreement between the proposed asymptotic analysis and recovery algorithm. Compared with existing works of peeling decoding algorithm, focusing on the failure probability of the recovery algorithm, our proposed approach gives accurate evolution of performance with different parameters of measurement matrices and is easy to implement. We also show that the peeling decoding algorithm performs better than other schemes based on LDPC codes.

Markov source model for printed music decoding

Science.gov (United States)

Kopec, Gary E.; Chou, Philip A.; Maltz, David A.

1995-03-01

This paper describes a Markov source model for a simple subset of printed music notation. The model is based on the Adobe Sonata music symbol set and a message language of our own design. Chord imaging is the most complex part of the model. Much of the complexity follows from a rule of music typography that requires the noteheads for adjacent pitches to be placed on opposite sides of the chord stem. This rule leads to a proliferation of cases for other typographic details such as dot placement. We describe the language of message strings accepted by the model and discuss some of the imaging issues associated with various aspects of the message language. We also point out some aspects of music notation that appear problematic for a finite-state representation. Development of the model was greatly facilitated by the duality between image synthesis and image decoding. Although our ultimate objective was a music image model for use in decoding, most of the development proceeded by using the evolving model for image synthesis, since it is computationally far less costly to image a message than to decode an image.

DS-OCDMA Encoder/Decoder Performance Analysis Using Optical Low-Coherence Reflectometry

Science.gov (United States)

Fsaifes, Ihsan; Lepers, Catherine; Obaton, Anne-Francoise; Gallion, Philippe

2006-08-01

Direct-sequence optical code-division multiple-access (DS-OCDMA) encoder/decoder based on sampled fiber Bragg gratings (S-FBGs) is characterized using phase-sensitive optical low-coherence reflectometry (OLCR). The OLCR technique allows localized measurements of FBG wavelength and physical length inside one S-FBG. This paper shows how the discrepancies between specifications and measurements of the different FBGs have some impact on spectral and temporal pulse responses of the OCDMA encoder/decoder. The FBG physical lengths lower than the specified ones are shown to affect the mean optical power reflected by the OCDMA encoder/decoder. The FBG wavelengths that are detuned from each other induce some modulations of S-FBG reflectivity resulting in encoder/decoder sensitivity to laser wavelength drift of the OCDMA system. Finally, highlighted by this OLCR study, some solutions to overcome limitations in performance with the S-FBG technology are suggested.

IQ Predicts Word Decoding Skills in Populations with Intellectual Disabilities

Science.gov (United States)

Levy, Yonata

2011-01-01

This is a study of word decoding in adolescents with Down syndrome and in adolescents with Intellectual Deficits of unknown etiology. It was designed as a replication of studies of word decoding in English speaking and in Hebrew speaking adolescents with Williams syndrome ([0230] and [0235]). Participants' IQ was matched to IQ in the groups with…

Coder and decoder of fractal signals of comb-type structure

Directory of Open Access Journals (Sweden)

Politanskyi R. L.

2014-08-01

Full Text Available The article presents a coder and decoder of fractal signals of comb-type structure (FSCS based on microcontrollers (MC. The coder and decoder consist of identical control modules, while their managed modules have different schematic constructions. The control module performs forming or recognition of signals, and also carries out the function of information exchange with a computer. The basic element of the control module is a PIC18F2550 microcontroller from MicroChip. The coder of the system forms fractal signals of a given order according to the information bits coming from the computer. Samples of the calculated values of the amplitudes of elementary rectangular pulses that constitute the structure of fractal pulses are stored in the memory of the microcontroller as a table. Minimum bit capacity of the DAC necessary for the generation of FSCS of fourth order is four bits. The operation algorithm, "wired" into the controller of the program, provides for encoding of the transmitted information by two-bit symbols. Recognition of the start of transmission of each byte in communication channel is performed by the transmission of the timing signal. In a decoder the microcontroller carries out reception and decoding of the received fractal signals which are then transmitted to the computer. The developed algorithm of the program for the microcontroller of the decoder is carried out by determination of order of fractal impulse after the value of sum of amplitudes of elementary impulses, constituents fractal signal. The programs for coder and decoder are written in "C". In the most critical places of the program influencing on the fast-acting of chart “assembler” insertions are done. The blocks of the coder and decoder were connected with a coaxial 10 meters long cable with an impendance of 75 Ohm. The signals generated by the developed coder of FSCS, were studied using a digital oscillograph. On the basis of the obtained spectrums, it is possible

Trapping the ribosome to control gene expression.

Science.gov (United States)

Boehringer, Daniel; Ban, Nenad

2007-09-21

Protein synthesis is often regulated by structured mRNAs that interact with ribosomes. In this issue of Cell, Marzi et al. (2007) provide insights into the autoregulation of protein S15 by visualizing the folded repressor mRNA on the ribosome stalled in the preinitiation state. These results have implications for our understanding of the mechanism of translation initiation in general.

Decoding DNA labels by melting curve analysis using real-time PCR.

Science.gov (United States)

Balog, József A; Fehér, Liliána Z; Puskás, László G

2017-12-01

Synthetic DNA has been used as an authentication code for a diverse number of applications. However, existing decoding approaches are based on either DNA sequencing or the determination of DNA length variations. Here, we present a simple alternative protocol for labeling different objects using a small number of short DNA sequences that differ in their melting points. Code amplification and decoding can be done in two steps using quantitative PCR (qPCR). To obtain a DNA barcode with high complexity, we defined 8 template groups, each having 4 different DNA templates, yielding 158 (>2.5 billion) combinations of different individual melting temperature (Tm) values and corresponding ID codes. The reproducibility and specificity of the decoding was confirmed by using the most complex template mixture, which had 32 different products in 8 groups with different Tm values. The industrial applicability of our protocol was also demonstrated by labeling a drone with an oil-based paint containing a predefined DNA code, which was then successfully decoded. The method presented here consists of a simple code system based on a small number of synthetic DNA sequences and a cost-effective, rapid decoding protocol using a few qPCR reactions, enabling a wide range of authentication applications.

Decoding the attended speech stream with multi-channel EEG: implications for online, daily-life applications

Science.gov (United States)

Mirkovic, Bojana; Debener, Stefan; Jaeger, Manuela; De Vos, Maarten

2015-08-01

Objective. Recent studies have provided evidence that temporal envelope driven speech decoding from high-density electroencephalography (EEG) and magnetoencephalography recordings can identify the attended speech stream in a multi-speaker scenario. The present work replicated the previous high density EEG study and investigated the necessary technical requirements for practical attended speech decoding with EEG. Approach. Twelve normal hearing participants attended to one out of two simultaneously presented audiobook stories, while high density EEG was recorded. An offline iterative procedure eliminating those channels contributing the least to decoding provided insight into the necessary channel number and optimal cross-subject channel configuration. Aiming towards the future goal of near real-time classification with an individually trained decoder, the minimum duration of training data necessary for successful classification was determined by using a chronological cross-validation approach. Main results. Close replication of the previously reported results confirmed the method robustness. Decoder performance remained stable from 96 channels down to 25. Furthermore, for less than 15 min of training data, the subject-independent (pre-trained) decoder performed better than an individually trained decoder did. Significance. Our study complements previous research and provides information suggesting that efficient low-density EEG online decoding is within reach.

A Listeria monocytogenes RNA helicase essential for growth and ribosomal maturation at low temperatures uses its C terminus for appropriate interaction with the ribosome.

Science.gov (United States)

Netterling, Sakura; Vaitkevicius, Karolis; Nord, Stefan; Johansson, Jörgen

2012-08-01

Listeria monocytogenes, a Gram-positive food-borne human pathogen, is able to grow at temperatures close to 0°C and is thus of great concern for the food industry. In this work, we investigated the physiological role of one DExD-box RNA helicase in Listeria monocytogenes. The RNA helicase Lmo1722 was required for optimal growth at low temperatures, whereas it was dispensable at 37°C. A Δlmo1722 strain was less motile due to downregulation of the major subunit of the flagellum, FlaA, caused by decreased flaA expression. By ribosomal fractionation experiments, it was observed that Lmo1722 was mainly associated with the 50S subunit of the ribosome. Absence of Lmo1722 decreased the fraction of 50S ribosomal subunits and mature 70S ribosomes and affected the processing of the 23S precursor rRNA. The ribosomal profile could be restored to wild-type levels in a Δlmo1722 strain expressing Lmo1722. Interestingly, the C-terminal part of Lmo1722 was redundant for low-temperature growth, motility, 23S rRNA processing, and appropriate ribosomal maturation. However, Lmo1722 lacking the C terminus showed a reduced affinity for the 50S and 70S fractions, suggesting that the C terminus is important for proper guidance of Lmo1722 to the 50S subunit. Taken together, our results show that the Listeria RNA helicase Lmo1722 is essential for growth at low temperatures, motility, and rRNA processing and is important for ribosomal maturation, being associated mainly with the 50S subunit of the ribosome.

Biometrics encryption combining palmprint with two-layer error correction codes

Science.gov (United States)

Li, Hengjian; Qiu, Jian; Dong, Jiwen; Feng, Guang

2017-07-01

To bridge the gap between the fuzziness of biometrics and the exactitude of cryptography, based on combining palmprint with two-layer error correction codes, a novel biometrics encryption method is proposed. Firstly, the randomly generated original keys are encoded by convolutional and cyclic two-layer coding. The first layer uses a convolution code to correct burst errors. The second layer uses cyclic code to correct random errors. Then, the palmprint features are extracted from the palmprint images. Next, they are fused together by XORing operation. The information is stored in a smart card. Finally, the original keys extraction process is the information in the smart card XOR the user's palmprint features and then decoded with convolutional and cyclic two-layer code. The experimental results and security analysis show that it can recover the original keys completely. The proposed method is more secure than a single password factor, and has higher accuracy than a single biometric factor.

The basis of orientation decoding in human primary visual cortex: fine- or coarse-scale biases?

Science.gov (United States)

Maloney, Ryan T

2015-01-01

Orientation signals in human primary visual cortex (V1) can be reliably decoded from the multivariate pattern of activity as measured with functional magnetic resonance imaging (fMRI). The precise underlying source of these decoded signals (whether by orientation biases at a fine or coarse scale in cortex) remains a matter of some controversy, however. Freeman and colleagues (J Neurosci 33: 19695-19703, 2013) recently showed that the accuracy of decoding of spiral patterns in V1 can be predicted by a voxel's preferred spatial position (the population receptive field) and its coarse orientation preference, suggesting that coarse-scale biases are sufficient for orientation decoding. Whether they are also necessary for decoding remains an open question, and one with implications for the broader interpretation of multivariate decoding results in fMRI studies. Copyright © 2015 the American Physiological Society.

Studies of the effects of ultraviolet radiation on the structural integrities of ribosomal RNA components of the Escherichia coli 50S ribosomal subunit

International Nuclear Information System (INIS)

Gorelic, L.; Parker, D.

1978-01-01

The effects of 254-nm radiation on the structural integrities of free and 50S ribosome-bound 5S and 23S ribosomal ribonucleic acids (rRNA) have been elucidated. Irradiation of aqueous solutions of Escherichia coli 50S ribosomes with 253.7-nm radiation results in the formation of single-strand breaks in double-stranded regions of the 23S rRNA component, but not in rRNA chain scission, and destabilization of the secondary structure of the 23S rRNA toward denaturation. The minimum doses of 253.7-nm radiation required for the first detection of the two effects are 7 x 10 19 quanta for the production of single-strand breaks in double-stranded regions of the 23S rRNA, and 19 quanta for destabilization of the 23S rRNA secondary structure. Free 23S rRNA is resistant toward photoinduced chain breakage at doses of 253.7-nm radiation up to at least 2.3 x 10 20 and is much less sensitive toward destabilization of secondary structure than ribosome-bound 23S rRNA. In contrast to the photosensitivity of 50S ribosome-bound 23S rRNA toward chain breakage, 50S ribosome-bound 5S rRNA is resistant toward chain breakage at doses of 253.7-nm radiation up to at least 2.3 x 10 20 quanta. Ribosome-bound 5S and 23S rRNA are also not photosensitive toward intermolecular 5S/23S rRNA cross-linkage

cDNA, genomic sequence cloning and analysis of the ribosomal ...

African Journals Online (AJOL)

Ribosomal protein L37A (RPL37A) is a component of 60S large ribosomal subunit encoded by the RPL37A gene, which belongs to the family of ribosomal L37AE proteins, located in the cytoplasm. The complementary deoxyribonucleic acid (cDNA) and the genomic sequence of RPL37A were cloned successfully from giant ...

SimCommSys: taking the errors out of error-correcting code simulations

Directory of Open Access Journals (Sweden)

Johann A. Briffa

2014-06-01

Full Text Available In this study, we present SimCommSys, a simulator of communication systems that we are releasing under an open source license. The core of the project is a set of C + + libraries defining communication system components and a distributed Monte Carlo simulator. Of principal interest is the error-control coding component, where various kinds of binary and non-binary codes are implemented, including turbo, LDPC, repeat-accumulate and Reed–Solomon. The project also contains a number of ready-to-build binaries implementing various stages of the communication system (such as the encoder and decoder, a complete simulator and a system benchmark. Finally, SimCommSys also provides a number of shell and python scripts to encapsulate routine use cases. As long as the required components are already available in SimCommSys, the user may simulate complete communication systems of their own design without any additional programming. The strict separation of development (needed only to implement new components and use (to simulate specific constructions encourages reproducibility of experimental work and reduces the likelihood of error. Following an overview of the framework, we provide some examples of how to use the framework, including the implementation of a simple codec, the specification of communication systems and their simulation.

Video coding and decoding devices and methods preserving ppg relevant information

NARCIS (Netherlands)

2013-01-01

The present invention relates to a video encoding device (10) for encoding video data and a corresponding video decoding device, wherein during decoding PPG relevant information shall be preserved. For this purpose the video coding device (10) comprises a first encoder (20) for encoding input video

Human Genome Research: Decoding DNA

Science.gov (United States)

dropdown arrow Site Map A-Z Index Menu Synopsis Human Genome Research: Decoding DNA Resources with of the DNA double helix during April 2003. James D. Watson, Francis Crick, and Maurice Wilkins were company Celera announced the completion of a "working draft" reference DNA sequence of the human

Decoder calibration with ultra small current sample set for intracortical brain-machine interface

Science.gov (United States)

Zhang, Peng; Ma, Xuan; Chen, Luyao; Zhou, Jin; Wang, Changyong; Li, Wei; He, Jiping

2018-04-01

Objective. Intracortical brain-machine interfaces (iBMIs) aim to restore efficient communication and movement ability for paralyzed patients. However, frequent recalibration is required for consistency and reliability, and every recalibration will require relatively large most current sample set. The aim in this study is to develop an effective decoder calibration method that can achieve good performance while minimizing recalibration time. Approach. Two rhesus macaques implanted with intracortical microelectrode arrays were trained separately on movement and sensory paradigm. Neural signals were recorded to decode reaching positions or grasping postures. A novel principal component analysis-based domain adaptation (PDA) method was proposed to recalibrate the decoder with only ultra small current sample set by taking advantage of large historical data, and the decoding performance was compared with other three calibration methods for evaluation. Main results. The PDA method closed the gap between historical and current data effectively, and made it possible to take advantage of large historical data for decoder recalibration in current data decoding. Using only ultra small current sample set (five trials of each category), the decoder calibrated using the PDA method could achieve much better and more robust performance in all sessions than using other three calibration methods in both monkeys. Significance. (1) By this study, transfer learning theory was brought into iBMIs decoder calibration for the first time. (2) Different from most transfer learning studies, the target data in this study were ultra small sample set and were transferred to the source data. (3) By taking advantage of historical data, the PDA method was demonstrated to be effective in reducing recalibration time for both movement paradigm and sensory paradigm, indicating a viable generalization. By reducing the demand for large current training data, this new method may facilitate the application