Sound transmission in strongly-curved slowly-varying cylindrical and annular lined ducts with flow

In this paper we consider the propagation of acoustic waves along a curved hollow or annular duct with lined walls. The curvature of the duct centreline and the wall radii vary slowly along the duct, allowing application of an asymptotic multiple scales analysis. This generalises Rienstra's analysis of a straight duct of varying cross-sectional radius. The result of the analysis is that the modal wavenumbers and mode shapes are determined locally as modes of a torus with the same local curvature, while the amplitude of the modes evolves as the mode propagates along the duct. The duct modes are found numerically at each axial location using a pseudo-spectral method. Unlike the case of a straight duct, there is a fundamental asymmetry between upstream and downstream propagating modes, with some mode shapes tending to be concentrated on either the inside or outside of the bend depending on the direction of propagation. The interaction between the presence of wall lining and curvature is investigated in particular; for instance, in a representative case it is found that the curvature causes the first few acoustic modes to be more heavily damped by the duct boundary than would be expected for a straight duct. Analytical progress can be made in the limit of very high mode order, in which case well-known 'whispering gallery' modes, localised close to the wall, can be identified.

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.