Sphere Lower Bound for Rotated Lattice Constellations in Fading Channels

We study the error probability performance of rotated lattice constellations in frequency-flat Nakagami-m block-fading channels. In particular, we use the sphere lower bound on the underlying infinite lattice as a performance benchmark. We show that the sphere lower bound has full diversity. We observe that optimally rotated lattices with largest known minimum product distance perform very close to the lower bound, while the ensemble of random rotations is shown to lack diversity and perform far from it.     

Approaching the Outage Probability of the Amplify-and-Forward Relay Fading Channel

We study coding techniques for the single-relay non-orthogonal amplify-and-forward half-duplex relay fading channel. Unlike the multiple-antenna case, we show that 2times2 rotations induce large gains in outage probability with no increase in decoding complexity under iterative probabilistic decoding. We compare rotated and unrotated turbo-coded schemes and show that they both perform close to their corresponding outage limits.     

Impact of signal constellation expansion on the achievable diversity of pragmatic bit-interleaved space-time codes

This letter studies the effect of signal constellation expansion on the achievable diversity of pragmatic bit-interleaved space-time codes in quasistatic multiple antenna channels. Signal constellation expansion can be obtained either by increasing the size of the constellation in the complex plane or by using multidimensional linear mappings. By means of two simple constructions, we provide a comparison of the two options with message passing decoding. We show that multidimensional expansion achieves some performance advantage over complex-plane expansion at the cost of significantly higher decoding complexity and larger peak-to-average power ratio of the transmitted signals     

Error probability analysis of bit-interleaved coded modulation

This correspondence presents a simple method to accurately compute the error probability of bit-interleaved coded modulation (BICM). Thanks to the binary-input output-symmetric (BIOS) nature of the channel, the pairwise error probability (PEP) is equal to the tail probability of a sum of random variables with a particular distribution. This probability is in turn computed with a saddlepoint approximation. Its precision is numerically validated for coded transmission over standard Gaussian noise and fully interleaved fading channels for both convolutional and turbo-like codes.     

西班牙毛革两用服装革加工理论及工艺技术应用

通过系统介绍具有国际领先水平的西班牙毛革两用服装革的加工原理及工艺技术应用 ,具体阐明了其漫长而复杂的生产流程 ,以及每道工序应如何做和这样做的理论依据。强调以绵羊皮为原料加工生产毛革两用服装革鞣制前脱脂的重要性。只有前期好的脱脂 ,才有好的鞣制 ,最终才有所要的理想的各种产品风格。     

西班牙毛革两用服装革加工理论及工艺技术应用(续)

通过系统介绍具有国际领先水平的西班牙毛革两用服装革的加工原理及工艺技术应用 ,具体阐明了其漫长而复杂的生产流程 ,以及每道工序应如何做和这样做的理论依据。强调以绵羊皮为原料加工生产毛革两用服装革鞣制前脱脂的重要性。只有前期好的脱脂 ,才有好的鞣制 ,最终才有所要的理想的各种产品风格。     

Coded modulation in the block-fading channel: coding theorems and code construction

We consider coded modulation schemes for the block-fading channel. In the setting where a codeword spans a finite number N of fading degrees of freedom, we show that coded modulations of rate R bit per complex dimension, over a finite signal set /spl chi//spl sube//spl Copf/ of size 2/sup M/, achieve the optimal rate-diversity tradeoff given by the Singleton bound /spl delta/(N,M,R)=1+/spl lfloor/N(1-R/M)/spl rfloor/, for R/spl isin/(0,M/spl rfloor/. Furthermore, we show also that the popular bit-interleaved coded modulation achieves the same optimal rate-diversity tradeoff. We present a novel coded modulation construction based on blockwise concatenation that systematically yields Singleton-bound achieving turbo-like codes defined over an arbitrary signal set /spl chi//spl sub//spl Copf/. The proposed blockwise concatenation significantly outperforms conventional serial and parallel turbo codes in the block-fading channel. We analyze the ensemble average performance under maximum-likelihood (ML) decoding of the proposed codes by means of upper bounds and tight approximations. We show that, differently from the additive white Gaussian noise (AWGN) and fully interleaved fading cases, belief-propagation iterative decoding performs very close to ML on the block-fading channel for any signal-to-noise ratio (SNR) and even for relatively short block lengths. We also show that, at constant decoding complexity per information bit, the proposed codes perform close to the information outage probability for any block length, while standard block codes (e.g., obtained by trellis termination of convolutional codes) have a gap from outage that increases with the block length: this is a different and more subtle manifestation of the so-called "interleaving gain" of turbo codes.     

Polarimetric radar interferometry for improved mine detection andsurface clutter rejection

A recently developed technique, polarimetric radar interferometry, is applied to tackle the problem of the detection of buried objects embedded in surface clutter. An experiment with a fully polarimetric radar in an anechoic chamber has been carried out using different frequency bands and baselines. The processed results show the ability of this technique to detect buried plastic mines and to measure their depth. This technique enables the detection of plastic mines even if their backscatter response is much lower than that of the surface clutter     

On the initial propagation of dental caries

A multi-dimensional model for dental caries is applied to study the shape of caries lesions in a realistic tooth geometry and to examine the rate of progress of caries. An upgraded model, taking into account the outer prismless enamel layer, is derived and solved. The model demonstrates the importance of this layer in delaying the onset of caries. The conclusions are discussed in light of experimental results.     

Employing the metabolic "branch point effect" to generate an all-or-none, digital-like response in enzymatic outputs and enzyme-based sensors

Here, we demonstrate a strategy to convert the graded Michaelis-Menten response typical of unregulated enzymes into a sharp, effectively all-or-none response. We do so using an approach analogous to the "branch point effect", a mechanism observed in naturally occurring metabolic networks in which two or more enzymes compete for the same substrate. As a model system, we used the enzymatic reaction of glucose oxidase (GOx) and coupled it to a second, nonsignaling reaction catalyzed by the higher affinity enzyme hexokinase (HK) such that, at low substrate concentrations, the second enzyme outcompetes the first, turning off the latter's response. Above an arbitrarily selected "threshold" substrate concentration, the nonsignaling HK enzyme saturates leading to a "sudden" activation of the first signaling GOx enzyme and a far steeper dose-response curve than that observed for simple Michaelis-Menten kinetics. Using the well-known GOx-based amperometric glucose sensor to validate our strategy, we have steepen the normally graded response of this enzymatic sensor into a discrete yes/no output similar to that of a multimeric cooperative enzyme with a Hill coefficient above 13. We have also shown that, by controlling the HK reaction we can precisely tune the threshold target concentration at which we observe the enzyme output. Finally, we demonstrate the utility of this strategy for achieving effective noise attenuation in enzyme logic gates. In addition to supporting the development of biosensors with digital-like output, we envisage that the use of all-or-none enzymatic responses will also improve our ability to engineer efficient enzyme-based catalysis reactions in synthetic biology applications.