On the VLSI design of a pipeline Reed-Solomon decoder using systolic arrays

A new very large scale integration (VLSI) design of a pipeline Reed-Solomon decoder is presented. The transform decoding technique used in a previous article is replaced by a time domain algorithm through a detailed comparison of their VLSI implementations. A new architecture that implements the time domain algorithm permits efficient pipeline processing with reduced circuitry. Erasure correction capability is also incorporated with little additional complexity. By using a multiplexing technique, a new implementation of Euclid's algorithm maintains the throughput rate with less circuitry. Such improvements result in both enhanced capability and significant reduction in silicon area

Short to long-range charge-transfer excitations in the zincbacteriochlorin-bacteriochlorin complex: a Bethe-Salpeter study

We study using the Bethe-Salpeter formalism the excitation energies of the zincbacteriochlorinbacteriochlorin dyad, a paradigmatic photosynthetic complex. In great contrast with standard timedependent density functional theory calculations with (semi)local kernels, charge transfer excitations are correctly located above the intramolecular Q-bands transitions found to be in excellent agreement with experiment. Further, the asymptotic Coulomb behavior towards the true quasiparticle gap for charge transfer excitations at long distance is correctly reproduced, showing that the present scheme allows to study with the same accuracy intramolecular and charge transfer excitations at various spatial range and screening environment without any adjustable parameter.Comment: 5 pages, 2 figures, 1 tabl

Experimental study of optimal measurements for quantum state tomography

Quantum tomography is a critically important tool to evaluate quantum hardware, making it essential to develop optimized measurement strategies that are both accurate and efficient. We compare a variety of strategies using nearly pure test states. Those that are informationally complete for all states are found to be accurate and reliable even in the presence of errors in the measurements themselves, while those designed to be complete only for pure states are far more efficient but highly sensitive to such errors. Our results highlight the unavoidable tradeoffs inherent to quantum tomography.Comment: 5 pages, 3 figure

A comparison of VLSI architectures for time and transform domain decoding of Reed-Solomon codes

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

A single chip VLSI Reed-Solomon decoder

A new VLSI design of a pipeline Reed-Solomon decoder is presented. The transform decoding technique used in a previous design is replaced by a time domain algorithm. A new architecture that implements such an algorithm permits efficient pipeline processing with minimum circuitry. A systolic array is also developed to perform erasure corrections in the new design. A modified form of Euclid's algorithm is implemented by a new architecture that maintains the throughput rate with less circuitry. Such improvements result in both enhanced capability and a significant reduction in silicon area, therefore making it possible to build a pipeline (31,15)RS decoder on a single VLSI chip

Quantum state tomography by continuous measurement and compressed sensing

The need to perform quantum state tomography on ever larger systems has spurred a search for methods that yield good estimates from incomplete data. We study the performance of compressed sensing (CS) and least squares (LS) estimators in a fast protocol based on continuous measurement on an ensemble of cesium atomic spins. Both efficiently reconstruct nearly pure states in the 16-dimensional ground manifold, reaching average fidelities FCS = 0.92 and FLS = 0.88 using similar amounts of incomplete data. Surprisingly, the main advantage of CS in our protocol is an increased robustness to experimental imperfections

A New Algorithm for Protein Design

We apply a new approach to the reverse protein folding problem. Our method uses a minimization function in the design process which is different from the energy function used for folding. For a lattice model, we show that this new approach produces sequences that are likely to fold into desired structures. Our method is a significant improvement over previous attempts which used the energy function for designing sequences.Comment: 10 pages latex 2.09 no figures. Use uufiles to decod