A comparison of full-rate full-diversity 2x2 space-time codes for WiMAX systems

Multiple-input multiple-output (MIMO) techniques have become an essential part of broadband wireless communications systems. For example, the recently developed IEEE 802.16e specifications for broadband wireless access include three MIMOprofiles employing 2×2 space-time codes (STCs), and two of these MIMO schemes are mandatory on the downlink of Mobile WiMAX systems. One of these has full rate, and the other has full diversity, but neither of them has both of the desired features. The third profile, namely, Matrix C, which is not mandatory, is both a full rate and a full diversity code, but it has a high decoder complexity. Recently, the attention was turned to the decodercomplexity issue and including this in the design criteria, several full-rate STCs were proposed as alternatives to Matrix C. In this paper, we review these different alternatives and compare them to Matrix C in terms of performances and the correspondingreceiver complexities.

Outage thresholds of LDPC codes over nonergodic block-fading channels

This paper derives approximations allowing the estimation of outage probability for standard irregular LDPC codes and full-diversity Root-LDPC codes used over nonergodic block-fading channels. Two separate approaches are discussed: a numerical approximation, obtained by curve fitting, for both code ensembles, and an analytical approximation for Root-LDPC codes, obtained under the assumption that the slope of the iterative threshold curve of a given code ensemble matches the slope of the outage capacity curve in the high-SNR regime.

On iterative performance of LDPC and Root-LDPC codes over block-fading channels

This paper presents our investigation on iterativedecoding performances of some sparse-graph codes on block-fading Rayleigh channels. The considered code ensembles are standard LDPC codes and Root-LDPC codes, first proposed in and shown to be able to attain the full transmission diversity. We study the iterative threshold performance of those codes as a function of fading gains of the transmission channel and propose a numerical approximation of the iterative threshold versus fading gains, both both LDPC and Root-LDPC codes.Also, we show analytically that, in the case of 2 fading blocks,the iterative threshold root of Root-LDPC codes is proportional to (α1 α2)1, where α1 and α2 are corresponding fading gains.From this result, the full diversity property of Root-LDPC codes immediately follows.

Topological locking restrains replication fork reversal.

Two-dimensional agarose gel electrophoresis, psoralen cross-linking, and electron microscopy were used to study the effects of positive supercoiling on fork reversal in isolated replication intermediates of bacterial DNA plasmids. The results obtained demonstrate that the formation of Holliday-like junctions at both forks of a replication bubble creates a topological constraint that prevents further regression of the forks. We propose that this topological locking of replication intermediates provides a biological safety mechanism that protects DNA molecules against extensive fork reversals.

Topological computation of local cohomology multiplicities.

We express the Lyubeznik numbers of the local ring of a complex isolated singularity in terms of Betti numbers of the associated real link.

Edge excitations and topological order in rotating Bose gas

The edge excitations and related topological orders of correlated states of a fast rotating Bose gas are studied. Using exact diagonalization of small systems, we compute the energies and number of edge excitations, as well as the boson occupancy near the edge for various states. The chiral Luttinger-liquid theory of Wen is found to be a good description of the edges of the bosonic Laughlin and other states identified as members of the principal Jain sequence for bosons. However, we find that in a harmonic trap the edge of the state identified as the Moore-Read (Pfaffian) state shows a number of anomalies. An experimental way of detecting these correlated states is also discussed.

Topological magnetic irreversibility in superconducting Pb samples of various shapes

The magnetic-field dependence of the magnetization of cylinders, disks, and spheres of pure type-I superconducting lead was investigated by means of isothermal measurements of first magnetization curves and hysteresis cycles. Depending on the geometry of the sample and the direction and intensity of the applied magnetic field, the intermediate state exhibits different irreversible features that become particularly highlighted in minor hysteresis cycles. The irreversibility is noticeably observed in cylinders and disks only when the magnetic field is parallel to the axis of revolution and is very subtle in spheres. When the magnetic field decreases from the normal state, the irreversibility appears at a temperature-dependent value whose distance to the thermodynamic critical field depends on the sample geometry. The irreversible features in the disks are altered when they are submitted to an annealing process. These results agree well with very recent high-resolution magneto-optical experiments in similar materials that were interpreted in terms of transitions between different topological structures for the flux configuration in the intermediate state. A discussion of the relative role of geometrical barriers for flux entry and exit and pinning effects as responsible for the magnetic irreversibility is given.

Models that include supercoiling of topological domains reproduce several known features of interphase chromosomes.

Understanding the structure of interphase chromosomes is essential to elucidate regulatory mechanisms of gene expression. During recent years, high-throughput DNA sequencing expanded the power of chromosome conformation capture (3C) methods that provide information about reciprocal spatial proximity of chromosomal loci. Since 2012, it is known that entire chromatin in interphase chromosomes is organized into regions with strongly increased frequency of internal contacts. These regions, with the average size of ∼1 Mb, were named topological domains. More recent studies demonstrated presence of unconstrained supercoiling in interphase chromosomes. Using Brownian dynamics simulations, we show here that by including supercoiling into models of topological domains one can reproduce and thus provide possible explanations of several experimentally observed characteristics of interphase chromosomes, such as their complex contact maps.

Synchronization reveals topological scales in complex networks

We study the relationship between topological scales and dynamic time scales in complex networks. The analysis is based on the full dynamics towards synchronization of a system of coupled oscillators. In the synchronization process, modular structures corresponding to well-defined communities of nodes emerge in different time scales, ordered in a hierarchical way. The analysis also provides a useful connection between synchronization dynamics, complex networks topology, and spectral graph analysis.

Discriminant ECOC: a heuristic method for application dependent design of error correcting output codes

We present a heuristic method for learning error correcting output codes matrices based on a hierarchical partition of the class space that maximizes a discriminative criterion. To achieve this goal, the optimal codeword separation is sacrificed in favor of a maximum class discrimination in the partitions. The creation of the hierarchical partition set is performed using a binary tree. As a result, a compact matrix with high discrimination power is obtained. Our method is validated using the UCI database and applied to a real problem, the classification of traffic sign images.

Subclass problem-dependent design for error-correcting output codes

A common way to model multiclass classification problems is by means of Error-Correcting Output Codes (ECOCs). Given a multiclass problem, the ECOC technique designs a code word for each class, where each position of the code identifies the membership of the class for a given binary problem. A classification decision is obtained by assigning the label of the class with the closest code. One of the main requirements of the ECOC design is that the base classifier is capable of splitting each subgroup of classes from each binary problem. However, we cannot guarantee that a linear classifier model convex regions. Furthermore, nonlinear classifiers also fail to manage some type of surfaces. In this paper, we present a novel strategy to model multiclass classification problems using subclass information in the ECOC framework. Complex problems are solved by splitting the original set of classes into subclasses and embedding the binary problems in a problem-dependent ECOC design. Experimental results show that the proposed splitting procedure yields a better performance when the class overlap or the distribution of the training objects conceal the decision boundaries for the base classifier. The results are even more significant when one has a sufficiently large training size.