Capacity approaching codes for non-coherent orthogonal modulation

This paper describes a curve-fitting approach for the design of capacity approaching coded modulation for orthogonal signal sets with non-coherent detection. In particular, bit-interleaved coded modulation with iterative decoding is considered. Decoder metrics are developed that do not require knowledge of the signal-to-noise ratio, yet still offer very good performance. © 2007 IEEE.

Comparison between weight loss of bends in a pneumatic conveyor and erosion rate obtained in a centrifugal erosion tester for the same materials

In order to find a link between results obtained from a laboratory erosion tester and tests carried out on a pneumatic conveyor, a comparison has been made between weight loss from bends on an industrial-scale pneumatic conveyor and erosion rates obtained in a small centrifugal erosion tester, for the same materials. Identical test conditions have been applied to both experiments so that comparable test results have been obtained. The erosion rate of mild steel commonly used as the wall material of conveyor pipes and pipe bends was determined individually on both test rigs. A relationship between weight loss from the bends and erosion rate determined from the tester has been developed. A discussion based on the results and their applicability to the prediction of wear in pneumatic conveyors concludes the paper. © 2004 Elsevier B.V. All rights reserved.

Comparison of constructions of irregular Gallager codes

The low-density parity check codes whose performance is closest to the Shannon limit are `Gallager codes' based on irregular graphs. We compare alternative methods for constructing these graphs and present two results. First, we find a `super-Poisson' construction which gives a small improvement in empirical performance over a random construction. Second, whereas Gallager codes normally take N2 time to encode, we investigate constructions of regular and irregular Gallager codes that allow more rapid encoding and have smaller memory requirements in the encoder. We find that these `fast encoding' Gallager codes have equally good performance.

Performance of low density parity check codes as a function of actual and assumed noise levels

We investigate how sensitive Gallager's codes are, when decoded by the sum-product algorithm, to the assumed noise level. We have found a remarkably simple function that fits the empirical results as a function of the actual noise level at both high and low noise levels. © 2004 Elsevier B.V.

Performance of low density parity check codes as a function of actual and assumed noise levels

We investigate how sensitive Gallager's codes are, when decoded by the sum-product algorithm, to the assumed noise level. We have found a remarkably simple function that fits the empirical results as a function of the actual noise level at both high and low noise levels. ©2003 Published by Elsevier Science B. V.