Asymptotic performance of single parity-check product codes

This article investigates the asymptotic performance of single parity-check (SPC) product codes (PCs) from a decoding point of view. Specifically, the probability of bit error is bounded before and after the decoding of each dimension, similar to the analysis of "iterated codes" by Elias (1954). It is shown that the asymptotic probability of bit error can be driven to zero as the number of dimensions, and hence the block length, increases at signal-to-noise ratios (SNRs) within 2 dB of capacity over the additive white Gaussian noise (AWGN) channel.     

Full-diversity, high-rate space-time block codes from division algebras

We present some general techniques for constructing full-rank, minimal-delay, rate at least one space-time block codes (STBCs) over a variety of signal sets for arbitrary number of transmit antennas using commutative division algebras (field extensions) as well as using noncommutative division algebras of the rational field /spl Qopf/ embedded in matrix rings. The first half of the paper deals with constructions using field extensions of /spl Qopf/. Working with cyclotomic field extensions, we construct several families of STBCs over a wide range of signal sets that are of full rank, minimal delay, and rate at least one appropriate for any number of transmit antennas. We study the coding gain and capacity of these codes. Using transcendental extensions we construct arbitrary rate codes that are full rank for arbitrary number of antennas. We also present a method of constructing STBCs using noncyclotomic field extensions. In the later half of the paper, we discuss two ways of embedding noncommutative division algebras into matrices: left regular representation, and representation over maximal cyclic subfields. The 4/spl times/4 real orthogonal design is obtained by the left regular representation of quaternions. Alamouti's (1998) code is just a special case of the construction using representation over maximal cyclic subfields and we observe certain algebraic uniqueness characteristics of it. Also, we discuss a general principle for constructing cyclic division algebras using the nth root of a transcendental element and study the capacity of the STBCs obtained from this construction. Another family of cyclic division algebras discovered by Brauer (1933) is discussed and several examples of STBCs derived from each of these constructions are presented.     

Optimal mean-square prediction of the mobile-radio fading envelope

Long-range prediction of the mobile-radio fading envelope is an enabling technology for many fading compensation approaches. Because the fading envelope is well modeled as a bandlimited process, it has special predictability properties. In this paper, we find a linear predictor that is optimal in the mean-square sense when the predictor impulse response is energy constrained. This solution may be used to determine the minimum mean squared error of a prediction based on past values that are corrupted with estimation errors.     

A distributed scheduling for agro-food manufacturing problems

Workshop scheduling problems can be considered as one of the main factors to improve the productivity and efficiency of a manufacturing system. The continuous evolution and the dynamic characteristics of industrial workshops, particularly those of agro-food industries, impose the generation of a real time decision scheduling process. In the agro-food industries, the products to be processed and the used primary products are characterized by their limit validity dates which generate some particularly and especially antagonist criteria. A distributed decision support system for real time scheduling is described in this paper. It is based on an original cooperative approach aimed to elaborate robust decisions that propose to the "best action" to the decision maker. The decision process is distributed all along the production chain. At each decision time, in order to ensure coherency, we have to take into account the neighborhood constraints in order to simultaneously satisfy different criteria which do not have the same importance. An aggregation criteria system is defined to manage the criteria among their importance degrees. We define a decisional model based on the evaluation and the comparison of a set of proposed actions.     

The extended quadratic residue code is the only (48,24,12) self-dual doubly-even code

An extremal self-dual doubly-even binary (n,k,d) code has a minimum weight d=4/spl lfloor/n/24/spl rfloor/+4. Of such codes with length divisible by 24, the Golay code is the only (24,12,8) code, the extended quadratic residue code is the only known (48,24,12) code, and there is no known (72,36,16) code. One may partition the search for a (48,24,12) self-dual doubly-even code into three cases. A previous search assuming one of the cases found only the extended quadratic residue code. We examine the remaining two cases. Separate searches assuming each of the remaining cases found no codes and thus the extended quadratic residue code is the only doubly-even self-dual (48,24,12) code.     

PNNI-based control plane for automatically switched optical networks

Much effort has been spent on the definition of control plane protocols for automatically switched optical networks (ASON). Most of the proposals brought into the standardization for an International Telecommunications Union-Telecommunication Sector, Internet Engineering Task Force, and Optical Internetworking Forum are based on Internet protocol concepts. One such proposal is the generalized multi-protocol label switching (GMPLS), an extension of the MPLS traffic engineering control plane model that includes nonpacket switched technologies (time, wavelength, and fiber switching). Recently, the potential use of private network-network interface (PNNI) in ASONs has been discussed as an alternative proposal by the standardization bodies. The goal of this paper is to appropriately adapt asynchronous transfer mode into an optical PNNI (O-PNNI) protocol that can be used as the control plane of ASONs. The paper also provides a critical viewpoint on the potential usage of either O-PNNI or GMPLS control plane and analyzes the pros and cons of each. The methodology adopted toward devising O-PNNI hinges on reviewing PNNI along with ASON recommendations in order to determine the set of PNNI features that require adaptation. Having identified these features we engineer and present appropriate solutions relating to routing, signaling and addressing aspects.     

Structural and magnetic properties of Ni/Pt multilayers

In this work, the variation of the magnetic moments of the Ni/Pt multilayers are studied using the linearized augmented plane waves (LAPW) method in the framework of the density functional theory (DFT) implemented in the version of WIEN2K program. The systems have been modeled by seven layers slab separated in z direction by a vacuum region of four substrate layers. We present the results of the dependence of the magnetic properties with respect to the thickness variation of the different multilayers. The modeling of these systems finds an important empirical support. Experiment and theory show the same trends for the magnetic moments: hybridization effects between Ni and Pt are mostly localized at the interface.     

Optical intensity-modulated direct detection channels: signal space and lattice codes

Traditional approaches to constructing constellations for electrical channels cannot be applied directly to the optical intensity channel. This work presents a structured signal space model for optical intensity channels where the nonnegativity and average amplitude constraints are represented geometrically. Lattice codes satisfying channel constraints are defined and coding and shaping gain relative to a baseline are computed. An effective signal space dimension is defined to represent the precise impact of coding and shaping on bandwidth. Average optical power minimizing shaping regions are derived in some special cases. Example lattice codes are constructed and their performance on an idealized point-to-point wireless optical link is computed. Bandwidth-efficient schemes are shown to have promise for high data-rate applications, but require greater average optical power.