Asymptotic Spectra of Trapping Sets in Regular and Irregular LDPC Code Ensembles

We evaluate the asymptotic normalized average distributions of a class of combinatorial configurations in random, regular and irregular, binary low-density parity-check (LDPC) code ensembles. Among the configurations considered are trapping and stopping sets. These sets represent subsets of variable nodes in the Tanner graph of a code that play an important role in determining the height and point of onset of the error-floor in its performance curve. The techniques used for deriving the spectra include large deviations theory and statistical methods for enumerating binary matrices with prescribed row and column sums. These techniques can also be applied in a setting that involves more general structural entities such as subcodes and/or minimal codewords, that are known to characterize other important properties of soft-decision decoders of linear block codes     

Acoustic characteristics of children''s voice

Four acoustic measures were taken from voice recordings of 121 children between the ages of 64 and 134 months. Acoustic parameters were measured on a sustained neutral /a/ vowel, produced imitatively at normal pitch and loudness. Samples were analyzed for fundamental frequency, jitter, shimmer, and signal-to-noise ratio (SNR). Data are presented to characterize effects of age, sex, height, and weight on these acoustic parameters. Results indicate statistically significant relationships between frequency and sex, with higher frequencies for girls. Also significant is a positive relationship between shimmer and height and a negative relationship between SNR and height.     

Model systems with extreme aspect ratio, tunable geometry, and surface functionality for a quantitative investigation of the Lotus effect

Superhydrophobicity and superhydrophilicity of surfaces are key properties for fabrication of self-cleaning surfaces (Lotus effect). It is well known that the mechanism behind this is based on the surface roughness and surface functionalization. To obtain an understanding of the details of the underlying mechanism, a metal system based on a eutectic is suggested. In this study, a wide range tunability of its needlelike narrow size distributed nanostructure is demonstrated. The length of the needles as well as their density can be varied independently. In addition, an important parameter for the wettability, the roughness, is related directly to the growth parameters, which lead to excellent controllable and reproducible eutectic structures. Simply by varying etching time very high aspect ratios can be achieved, allowing studying the interaction of the very long needles with liquids. Moreover, the surface functionality can be tuned by RF-magnetron sputtering of PTFE onto the metal needles. As those layers can be very thin, our system allows, in principle, studying the transition from a metal to a polymer surface using submonolayers. Furthermore, the first contact angle measurements on the nanostructured and functionalized eutectic structures are presented and discussed.     

Effect of Microdiversity and Macrodiversity on Average Bit Error Probability in Gamma‐Shadowed Rician Fading Channels

In this letter, we analyze the error performance of a mobile communication system with microdiversity and macrodiversity reception in gamma‐shadowed Rician fading channels for a binary differential phase‐shift keying modulation scheme. Analytical expressions for the probability density function (PDF) and moment‐generating function (MGF) are derived. The average bit error probability can be calculated by averaging the conditional bit error probability over the PDF or using the MGF‐based approach. Numerical results are graphically presented to show the effects of macrodiversity, correlation, number of diversity branches, and severity of both fading and shadowing.     

Shortened Array Codes of Large Girth

One approach to designing structured low-density parity-check (LDPC) codes with large girth is to shorten codes with small girth in such a manner that the deleted columns of the parity-check matrix contain all the variables involved in short cycles. This approach is especially effective if the parity-check matrix of a code is a matrix composed of blocks of circulant permutation matrices, as is the case for the class of codes known as array codes. We show how to shorten array codes by deleting certain columns of their parity-check matrices so as to increase their girth. The shortening approach is based on the observation that for array codes, and in fact for a slightly more general class of LDPC codes, the cycles in the corresponding Tanner graph are governed by certain homogeneous linear equations with integer coefficients. Consequently, we can selectively eliminate cycles from an array code by only retaining those columns from the parity-check matrix of the original code that are indexed by integer sequences that do not contain solutions to the equations governing those cycles. We provide Ramsey-theoretic estimates for the maximum number of columns that can be retained from the original parity-check matrix with the property that the sequence of their indices avoid solutions to various types of cycle-governing equations. This translates to estimates of the rate penalty incurred in shortening a code to eliminate cycles. Simulation results show that for the codes considered, shortening them to increase the girth can lead to significant gains in signal-to-noise ratio (SNR) in the case of communication over an additive white Gaussian noise (AWGN) channel