Expectation Shock Simulation with DYNARE

This note demonstrates a tool which is designed for conducting an expectation shock simulation easily with DYNARE.

LOCO Codes: Lexicographically-Ordered Constrained Codes

Line codes make it possible to mitigate interference, to prevent short pulses, and to generate streams of bipolar signals with no direct-current (DC) power content through balancing. They find application in magnetic recording (MR) devices, in Flash devices, in optical recording devices, and in some computer standards. This paper introduces a new family of fixed-length, binary constrained codes, named lexicographically-ordered constrained codes (LOCO codes), for bipolar non-return-to-zero signaling. LOCO codes are capacity-achieving, the lexicographic indexing enables simple, practical encoding and decoding, and this simplicity is demonstrated through analysis of circuit complexity. LOCO codes are easy to balance, and their inherent symmetry minimizes the rate loss with respect to unbalanced codes having the same constraints. Furthermore, LOCO codes that forbid certain patterns can be used to alleviate inter-symbol interference in MR systems and inter-cell interference in Flash systems. Numerical results demonstrate a gain of up to 10% in rate achieved by LOCO codes with respect to other practical constrained codes, including run-length-limited codes, designed for the same purpose. Simulation results suggest that it is possible to achieve a channel density gain of about 20% in MR systems by using a LOCO code to encode only the parity bits, limiting the rate loss, of a low-density parity-check code before writing.Comment: 17 pages (double column), 2 figures, accepted at the IEEE Transactions on Information Theory (TIT), the short version was accepted at the IEEE Information Theory Workshop (ITW), this version reflects comments from reviewers at TIT and IT

Correlation of SA349/2 helicopter flight-test data with a comprehensive rotorcraft model

A comprehensive rotorcraft analysis model was used to predict blade aerodynamic and structural loads for comparison with flight test data. The data were obtained from an SA349/2 helicopter with an advanced geometry rotor. Sensitivity of the correlation to wake geometry, blade dynamics, and blade aerodynamic effects was investigated. Blade chordwise pressure coefficients were predicted for the blade transonic regimes using the model coupled with two finite-difference codes

Model Code of Conduct

Code of conduct to be adopted by WRC member schools and colleges as the standard they will require of licensees. The Worker Rights Consortium will use this code of conduct as the basis for its investigations

Space Frequency Codes from Spherical Codes

A new design method for high rate, fully diverse ('spherical') space frequency codes for MIMO-OFDM systems is proposed, which works for arbitrary numbers of antennas and subcarriers. The construction exploits a differential geometric connection between spherical codes and space time codes. The former are well studied e.g. in the context of optimal sequence design in CDMA systems, while the latter serve as basic building blocks for space frequency codes. In addition a decoding algorithm with moderate complexity is presented. This is achieved by a lattice based construction of spherical codes, which permits lattice decoding algorithms and thus offers a substantial reduction of complexity.Comment: 5 pages. Final version for the 2005 IEEE International Symposium on Information Theor

Beyond Stabilizer Codes II: Clifford Codes

Knill introduced a generalization of stabilizer codes, in this note called Clifford codes. It remained unclear whether or not Clifford codes can be superior to stabilizer codes. We show that Clifford codes are stabilizer codes provided that the abstract error group has an abelian index group. In particular, if the errors are modelled by tensor products of Pauli matrices, then the associated Clifford codes are necessarily stabilizer codes.Comment: 9 pages, LaTeX2e. Minor changes. Title changed by request of IEEE Trans. I